Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Graph theory concept
|
| gptkbp:appliesTo |
Directed graphs
Undirected graphs |
| gptkbp:category |
Combinatorics
Discrete mathematics |
| gptkbp:characterizedBy |
A directed graph has an Eulerian path if and only if at most one vertex has (out-degree) − (in-degree) = 1, at most one vertex has (in-degree) − (out-degree) = 1, and all other vertices have equal in-degree and out-degree
A connected undirected graph has an Eulerian path if and only if it has exactly zero or two vertices of odd degree |
| gptkbp:definedIn |
A trail in a graph that visits every edge exactly once
|
| https://www.w3.org/2000/01/rdf-schema#label |
Eulerian Path
|
| gptkbp:namedAfter |
gptkb:Leonhard_Euler
|
| gptkbp:relatedTo |
gptkb:Hamiltonian_Path
Eulerian Circuit |
| gptkbp:studiedBy |
gptkb:Leonhard_Euler
gptkb:Seven_Bridges_of_Königsberg_problem 1736 |
| gptkbp:supportsAlgorithm |
gptkb:Fleury's_algorithm
gptkb:Hierholzer's_algorithm |
| gptkbp:usedIn |
DNA sequencing
Network analysis Route planning Graph traversal algorithms |
| gptkbp:bfsParent |
gptkb:Hamiltonian_Path
|
| gptkbp:bfsLayer |
7
|