Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
graph
|
| gptkbp:application |
solving the Königsberg bridge problem
|
| gptkbp:contrastsWith |
Hamiltonian graph
|
| gptkbp:cycle |
gptkb:Eulerian_cycle
|
| gptkbp:definedIn |
a graph in which there exists a closed trail that includes every edge exactly once
|
| gptkbp:generalizes |
gptkb:Eulerian_trail
|
| https://www.w3.org/2000/01/rdf-schema#label |
Eulerian graph
|
| gptkbp:namedAfter |
gptkb:Leonhard_Euler
|
| gptkbp:property |
connected (for undirected graphs with more than one edge)
all vertices have even degree (for undirected graphs) |
| gptkbp:relatedTo |
gptkb:Eulerian_circuit
gptkb:Eulerian_path |
| gptkbp:studiedBy |
gptkb:Leonhard_Euler
|
| gptkbp:studiedIn |
graph theory
|
| gptkbp:usedIn |
network analysis
DNA sequencing circuit design route inspection problem |
| gptkbp:bfsParent |
gptkb:Hamiltonian_graph
|
| gptkbp:bfsLayer |
5
|