Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Eulerian_path> ?p ?o }
- Eulerian_path 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.".
- Eulerian_path thumbnail Königsberg_graph.svg?width=300.
- Eulerian_path wikiPageExternalLink E053.html.
- Eulerian_path wikiPageExternalLink message.jspa?messageID=3648262&tstart=135.
- Eulerian_path wikiPageExternalLink Euler_tour.
- Eulerian_path wikiPageID "333219".
- Eulerian_path wikiPageLength "16896".
- Eulerian_path wikiPageOutDegree "72".
- Eulerian_path wikiPageRevisionID "702272810".
- Eulerian_path wikiPageWikiLink American_Mathematical_Monthly.
- Eulerian_path wikiPageWikiLink Anton_Kotzig.
- Eulerian_path wikiPageWikiLink Arborescence_(graph_theory).
- Eulerian_path wikiPageWikiLink Asymptotic_analysis.
- Eulerian_path wikiPageWikiLink BEST_theorem.
- Eulerian_path wikiPageWikiLink Bijective_proof.
- Eulerian_path wikiPageWikiLink Bioinformatics.
- Eulerian_path wikiPageWikiLink Brendan_McKay.
- Eulerian_path wikiPageWikiLink Bridge_(graph_theory).
- Eulerian_path wikiPageWikiLink CMOS.
- Eulerian_path wikiPageWikiLink Carl_Hierholzer.
- Eulerian_path wikiPageWikiLink Category:Graph_theory_objects.
- Eulerian_path wikiPageWikiLink Cedric_Smith_(statistician).
- Eulerian_path wikiPageWikiLink Complete_bipartite_graph.
- Eulerian_path wikiPageWikiLink Complete_graph.
- Eulerian_path wikiPageWikiLink Connected_component_(graph_theory).
- Eulerian_path wikiPageWikiLink Connectivity_(graph_theory).
- Eulerian_path wikiPageWikiLink Cycle_(graph_theory).
- Eulerian_path wikiPageWikiLink De_Bruijn_sequence.
- Eulerian_path wikiPageWikiLink Degree_(graph_theory).
- Eulerian_path wikiPageWikiLink Determinant.
- Eulerian_path wikiPageWikiLink Directed_graph.
- Eulerian_path wikiPageWikiLink Doubly_linked_list.
- Eulerian_path wikiPageWikiLink Encyclopedia_of_Mathematics.
- Eulerian_path wikiPageWikiLink Eulerian_matroid.
- Eulerian_path wikiPageWikiLink Five_room_puzzle.
- Eulerian_path wikiPageWikiLink Glossary_of_graph_theory.
- Eulerian_path wikiPageWikiLink Graph_(discrete_mathematics).
- Eulerian_path wikiPageWikiLink Graph_theory.
- Eulerian_path wikiPageWikiLink Hamiltonian_path.
- Eulerian_path wikiPageWikiLink Handshaking_lemma.
- Eulerian_path wikiPageWikiLink Kirchhoffs_theorem.
- Eulerian_path wikiPageWikiLink Leonhard_Euler.
- Eulerian_path wikiPageWikiLink Logic_gate.
- Eulerian_path wikiPageWikiLink Markov_chain_Monte_Carlo.
- Eulerian_path wikiPageWikiLink Mathematische_Annalen.
- Eulerian_path wikiPageWikiLink Multigraph.
- Eulerian_path wikiPageWikiLink Nicolaas_Govert_de_Bruijn.
- Eulerian_path wikiPageWikiLink Nucleic_acid_sequence.
- Eulerian_path wikiPageWikiLink Robert_Tarjan.
- Eulerian_path wikiPageWikiLink Route_inspection_problem.
- Eulerian_path wikiPageWikiLink Seven_Bridges_of_Königsberg.
- Eulerian_path wikiPageWikiLink Sharp-P.
- Eulerian_path wikiPageWikiLink Simon_Stevin_(journal).
- Eulerian_path wikiPageWikiLink Strong_orientation.
- Eulerian_path wikiPageWikiLink Strongly_connected_component.
- Eulerian_path wikiPageWikiLink Symposium_on_Theory_of_Computing.
- Eulerian_path wikiPageWikiLink Tatyana_Pavlovna_Ehrenfest.
- Eulerian_path wikiPageWikiLink Time_complexity.
- Eulerian_path wikiPageWikiLink Tree_(graph_theory).
- Eulerian_path wikiPageWikiLink Veblens_theorem.
- Eulerian_path wikiPageWikiLink Vertex_(graph_theory).
- Eulerian_path wikiPageWikiLink W._T._Tutte.
- Eulerian_path wikiPageWikiLink File:Königsberg_graph.svg.
- Eulerian_path wikiPageWikiLink File:Labelled_Eulergraph.svg.
- Eulerian_path wikiPageWikiLinkText "Eulerian circuit".
- Eulerian_path wikiPageWikiLinkText "Eulerian orientation".
- Eulerian_path wikiPageWikiLinkText "Eulerian path".
- Eulerian_path wikiPageWikiLinkText "Eulerian path#Definition".
- Eulerian_path wikiPageWikiLinkText "Eulerian path#Fleury's algorithm".
- Eulerian_path wikiPageWikiLinkText "Eulerian path#Hierholzer's algorithm".
- Eulerian_path wikiPageWikiLinkText "Eulerian subgraph".
- Eulerian_path wikiPageWikiLinkText "Eulerian".
- Eulerian_path wikiPageWikiLinkText "Eulerian_path#Complexity_issues".
- Eulerian_path wikiPageWikiLinkText "unicursal star".
- Eulerian_path wikiPageWikiLinkText "unicursal".
- Eulerian_path wikiPageUsesTemplate Template:Citation.
- Eulerian_path wikiPageUsesTemplate Template:Commons_category.
- Eulerian_path wikiPageUsesTemplate Template:Harvtxt.
- Eulerian_path wikiPageUsesTemplate Template:Reflist.
- Eulerian_path wikiPageUsesTemplate Template:Sic.
- Eulerian_path subject Category:Graph_theory_objects.
- Eulerian_path hypernym Trail.
- Eulerian_path type Place.
- Eulerian_path type Object.
- Eulerian_path 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.".
- Eulerian_path label "Eulerian path".
- Eulerian_path sameAs Q624580.
- Eulerian_path sameAs دارة_أويلرية.
- Eulerian_path sameAs Camí_eulerià.
- Eulerian_path sameAs Eulerovský_tah.
- Eulerian_path sameAs Euler-tur.
- Eulerian_path sameAs Eulerkreisproblem.
- Eulerian_path sameAs Ciclo_euleriano.
- Eulerian_path sameAs Euleri_graaf.
- Eulerian_path sameAs Eulertar_grafo.
- Eulerian_path sameAs دور_اویلری.
- Eulerian_path sameAs Eulerin_polku.
- Eulerian_path sameAs Graphe_eulérien.
- Eulerian_path sameAs מסלול_אוילר.
- Eulerian_path sameAs Euler-kör.