Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q624580> ?p ?o }
Showing triples 1 to 62 of
62
with 100 triples per page.
- Q624580 subject Q6465276.
- Q624580 abstract "In graph theory, an Eulerian trail (or Eulerian path) is a trail in a graph which visits every edge exactly once. Similarly, an Eulerian circuit or Eulerian cycle is an Eulerian trail which starts and ends on the same vertex. They were first discussed by Leonhard Euler while solving the famous Seven Bridges of Königsberg problem in 1736. Mathematically the problem can be stated like this:Given the graph in the image, is it possible to construct a path (or a cycle, i.e. a path starting and ending on the same vertex) which visits each edge exactly once?Euler proved that a necessary condition for the existence of Eulerian circuits is that all vertices in the graph have an even degree, and stated without proof that connected graphs with all vertices of even degree have an Eulerian circuit. The first complete proof of this latter claim was published posthumously in 1873 by Carl Hierholzer.The term Eulerian graph has two common meanings in graph theory. One meaning is a graph with an Eulerian circuit, and the other is a graph with every vertex of even degree. These definitions coincide for connected graphs.For the existence of Eulerian trails it is necessary that zero or two vertices have an odd degree; this means the Königsberg graph is not Eulerian. If there are no vertices of odd degree, all Eulerian trails are circuits. If there are exactly two vertices of odd degree, all Eulerian trails start at one of them and end at the other. A graph that has an Eulerian trail but not an Eulerian circuit is called semi-Eulerian.".
- Q624580 thumbnail Königsberg_graph.svg?width=300.
- Q624580 wikiPageExternalLink E053.html.
- Q624580 wikiPageExternalLink message.jspa?messageID=3648262&tstart=135.
- Q624580 wikiPageExternalLink Euler_tour.
- Q624580 wikiPageWikiLink Q10559614.
- Q624580 wikiPageWikiLink Q1078285.
- Q624580 wikiPageWikiLink Q1137726.
- Q624580 wikiPageWikiLink Q1191869.
- Q624580 wikiPageWikiLink Q128570.
- Q624580 wikiPageWikiLink Q1304193.
- Q624580 wikiPageWikiLink Q131476.
- Q624580 wikiPageWikiLink Q1322138.
- Q624580 wikiPageWikiLink Q1340196.
- Q624580 wikiPageWikiLink Q1391861.
- Q624580 wikiPageWikiLink Q141488.
- Q624580 wikiPageWikiLink Q1520825.
- Q624580 wikiPageWikiLink Q15765772.
- Q624580 wikiPageWikiLink Q1631851.
- Q624580 wikiPageWikiLink Q166507.
- Q624580 wikiPageWikiLink Q17011123.
- Q624580 wikiPageWikiLink Q170451.
- Q624580 wikiPageWikiLink Q173431.
- Q624580 wikiPageWikiLink Q178546.
- Q624580 wikiPageWikiLink Q1953457.
- Q624580 wikiPageWikiLink Q2003238.
- Q624580 wikiPageWikiLink Q2226691.
- Q624580 wikiPageWikiLink Q230655.
- Q624580 wikiPageWikiLink Q2393193.
- Q624580 wikiPageWikiLink Q245595.
- Q624580 wikiPageWikiLink Q2532492.
- Q624580 wikiPageWikiLink Q2642629.
- Q624580 wikiPageWikiLink Q2707818.
- Q624580 wikiPageWikiLink Q272735.
- Q624580 wikiPageWikiLink Q273037.
- Q624580 wikiPageWikiLink Q2997928.
- Q624580 wikiPageWikiLink Q33100.
- Q624580 wikiPageWikiLink Q3527004.
- Q624580 wikiPageWikiLink Q383444.
- Q624580 wikiPageWikiLink Q45715.
- Q624580 wikiPageWikiLink Q5057154.
- Q624580 wikiPageWikiLink Q5300179.
- Q624580 wikiPageWikiLink Q591217.
- Q624580 wikiPageWikiLink Q592286.
- Q624580 wikiPageWikiLink Q6465276.
- Q624580 wikiPageWikiLink Q703577.
- Q624580 wikiPageWikiLink Q72985.
- Q624580 wikiPageWikiLink Q752718.
- Q624580 wikiPageWikiLink Q7604.
- Q624580 wikiPageWikiLink Q7624577.
- Q624580 wikiPageWikiLink Q7661893.
- Q624580 wikiPageWikiLink Q7917710.
- Q624580 wikiPageWikiLink Q7963212.
- Q624580 wikiPageWikiLink Q863908.
- Q624580 wikiPageWikiLink Q901096.
- Q624580 wikiPageWikiLink Q913598.
- Q624580 wikiPageWikiLink Q92638.
- Q624580 wikiPageWikiLink Q954454.
- Q624580 comment "In graph theory, an Eulerian trail (or Eulerian path) is a trail in a graph which visits every edge exactly once. Similarly, an Eulerian circuit or Eulerian cycle is an Eulerian trail which starts and ends on the same vertex. They were first discussed by Leonhard Euler while solving the famous Seven Bridges of Königsberg problem in 1736. Mathematically the problem can be stated like this:Given the graph in the image, is it possible to construct a path (or a cycle, i.e.".
- Q624580 label "Eulerian path".
- Q624580 depiction Königsberg_graph.svg.