Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
graph
|
| gptkbp:alsoKnownAs |
gptkb:Eulerian_circuit
|
| gptkbp:application |
DNA sequencing
circuit design network design route inspection problem |
| gptkbp:characterizedBy |
strongly connected and indegree equals outdegree 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
|
| gptkbp:existsIn |
directed graphs
undirected graphs |
| https://www.w3.org/2000/01/rdf-schema#label |
Eulerian cycle
|
| gptkbp:isCycle |
true
|
| gptkbp:isSubgraphOf |
gptkb:Eulerian_graph
|
| gptkbp:namedAfter |
gptkb:Leonhard_Euler
|
| gptkbp:relatedTo |
gptkb:Hamiltonian_cycle
gptkb:Eulerian_path |
| gptkbp:studiedBy |
gptkb:Leonhard_Euler
gptkb:Königsberg_bridge_problem |
| gptkbp:supportsAlgorithm |
gptkb:Fleury's_algorithm
gptkb:Hierholzer's_algorithm |
| gptkbp:bfsParent |
gptkb:Hamiltonian_cycle
|
| gptkbp:bfsLayer |
5
|