Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
graph
|
| gptkbp:alsoKnownAs |
gptkb:Eulerian_path
|
| gptkbp:application |
network analysis
DNA sequencing circuit design route inspection problem |
| gptkbp:definedIn |
a trail in a graph that visits every edge exactly once
|
| gptkbp:existsIn |
a connected undirected graph has exactly zero or two vertices of odd degree
directed graphs under certain conditions |
| https://www.w3.org/2000/01/rdf-schema#label |
Eulerian trail
|
| gptkbp:namedAfter |
gptkb:Leonhard_Euler
|
| gptkbp:relatedTo |
gptkb:Hamiltonian_path
gptkb:Eulerian_circuit |
| gptkbp:studiedBy |
gptkb:Königsberg_bridge_problem
|
| gptkbp:studiedIn |
graph theory
|
| gptkbp:bfsParent |
gptkb:Eulerian_graph
gptkb:Eulerian_circuit |
| gptkbp:bfsLayer |
6
|