Statements (28)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Graph Theory Concept
|
| gptkbp:alsoKnownAs |
Eulerian Circuit
|
| gptkbp:appliesTo |
gptkb:Undirected_Graph
Directed Graph |
| gptkbp:category |
gptkb:Mathematics
Combinatorics Cycle (Graph Theory) |
| gptkbp:characterizedBy |
Strongly connected and in-degree equals out-degree for all vertices (in directed graphs)
All vertices have even degree (in undirected graphs) |
| gptkbp:definedIn |
A cycle in a graph that visits every edge exactly once and returns to the starting vertex
|
| gptkbp:hasApplication |
Network Design
Circuit Design |
| gptkbp:hasSpecialCase |
Eulerian Trail
|
| https://www.w3.org/2000/01/rdf-schema#label |
Eulerian Cycle
|
| gptkbp:isNotPossibleIf |
Any vertex has odd degree (in undirected graphs)
Graph is disconnected |
| gptkbp:namedAfter |
gptkb:Leonhard_Euler
|
| gptkbp:relatedTo |
gptkb:Eulerian_Path
|
| gptkbp:studiedBy |
gptkb:Leonhard_Euler
1736 Königsberg Bridge Problem |
| gptkbp:supportsAlgorithm |
Fleury's Algorithm
Hierholzer's Algorithm |
| gptkbp:usedIn |
Route Planning
DNA Sequencing Graph Traversal Algorithms |
| gptkbp:bfsParent |
gptkb:Hamiltonian_Cycle
|
| gptkbp:bfsLayer |
7
|