Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:application |
DNA sequencing
circuit design network design |
| gptkbp:appliesTo |
directed graphs
undirected graphs |
| gptkbp:complexity |
polynomial time
|
| gptkbp:concerns |
finding a cycle in a graph that visits every edge exactly once
|
| gptkbp:criteria |
all vertices have even degree (for undirected graphs)
strongly connected and indegree equals outdegree for all vertices (for directed graphs) |
| gptkbp:example |
gptkb:Königsberg_bridge_problem
|
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Eulerian circuit problem
|
| gptkbp:namedAfter |
gptkb:Leonhard_Euler
|
| gptkbp:relatedTo |
gptkb:Eulerian_circuit
gptkb:Eulerian_path |
| gptkbp:solvedBy |
gptkb:Euler's_theorem
|
| gptkbp:studiedBy |
gptkb:Leonhard_Euler
|
| gptkbp:supportsAlgorithm |
gptkb:Fleury's_algorithm
gptkb:Hierholzer's_algorithm |
| gptkbp:bfsParent |
gptkb:Hierholzer's_algorithm
|
| gptkbp:bfsLayer |
7
|