Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
graph
|
| gptkbp:application |
network analysis
DNA sequencing circuit design puzzle solving |
| gptkbp:category |
gptkb:mathematics
discrete mathematics combinatorics |
| gptkbp:definedIn |
a trail in a graph that visits every edge exactly once
|
| gptkbp:existenceCondition |
a directed graph has an Eulerian path if and only if at most one vertex has (out-degree) − (in-degree) = 1, at most one vertex has (in-degree) − (out-degree) = 1, and all other vertices have equal in-degree and out-degree
a connected undirected graph has an Eulerian path if and only if it has exactly zero or two vertices of odd degree |
| https://www.w3.org/2000/01/rdf-schema#label |
Eulerian paths
|
| gptkbp:namedAfter |
gptkb:Leonhard_Euler
|
| gptkbp:relatedTo |
gptkb:Hamiltonian_path
gptkb:Eulerian_circuit |
| gptkbp:solvedBy |
gptkb:Fleury's_algorithm
gptkb:Hierholzer's_algorithm |
| gptkbp:studiedBy |
gptkb:Königsberg_bridge_problem
|
| gptkbp:studiedIn |
graph theory
|
| gptkbp:bfsParent |
gptkb:Graph_theory
|
| gptkbp:bfsLayer |
5
|