Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
graph theory theorem |
| gptkbp:appliesTo |
undirected graphs
|
| gptkbp:author |
gptkb:Leonhard_Euler
|
| gptkbp:countryOfPublication |
gptkb:Latin
|
| gptkbp:describes |
existence of Eulerian path in a graph
|
| gptkbp:field |
graph theory
|
| gptkbp:firstPublished |
gptkb:Solutio_problematis_ad_geometriam_situs_pertinentis
|
| gptkbp:formedBy |
1736
|
| https://www.w3.org/2000/01/rdf-schema#label |
Eulerscher Wegsatz
|
| gptkbp:influenced |
gptkb:topology
combinatorics |
| gptkbp:namedAfter |
gptkb:Leonhard_Euler
|
| gptkbp:relatedTo |
gptkb:Königsberg_bridge_problem
|
| gptkbp:state |
A connected graph has an Eulerian circuit if and only if every vertex has even degree.
A connected graph has an Eulerian path if and only if it has exactly zero or two vertices of odd degree. |
| gptkbp:bfsParent |
gptkb:Satz_von_Euler
|
| gptkbp:bfsLayer |
6
|