Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
graph
|
| gptkbp:definedIn |
a trail in a graph that visits every edge exactly once
|
| gptkbp:existsIn |
a connected graph with exactly zero or two vertices of odd degree
|
| gptkbp:first_studied_in |
gptkb:Königsberg_bridge_problem
|
| gptkbp:hasProperty |
if exactly two vertices have odd degree, the path starts and ends at those vertices
if all vertices have even degree, the path is a circuit (Eulerian circuit) |
| https://www.w3.org/2000/01/rdf-schema#label |
Eulerian path
|
| gptkbp:namedAfter |
gptkb:Leonhard_Euler
|
| gptkbp:relatedTo |
gptkb:Hamiltonian_path
gptkb:Eulerian_circuit |
| gptkbp:solvedBy |
gptkb:Fleury's_algorithm
gptkb:Hierholzer's_algorithm |
| gptkbp:used_in |
bioinformatics
network analysis circuit design puzzle solving graph traversal |
| gptkbp:bfsParent |
gptkb:Hamiltonian_path
gptkb:Seven_Bridges_of_Königsberg |
| gptkbp:bfsLayer |
5
|