Euler's theorem in graph theory
GPTKB entity
Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
finite undirected graphs
|
| gptkbp:field |
graph theory
|
| gptkbp:firstAppearance |
gptkb:Seven_Bridges_of_Königsberg
|
| https://www.w3.org/2000/01/rdf-schema#label |
Euler's theorem in graph theory
|
| gptkbp:namedAfter |
gptkb:Leonhard_Euler
|
| gptkbp:relatedTo |
gptkb:Eulerian_circuit
gptkb:Eulerian_path connected graph degree of vertex |
| gptkbp:state |
A connected graph has an Eulerian circuit if and only if every vertex has even degree.
|
| gptkbp:usedIn |
network analysis
circuit design route planning |
| gptkbp:yearProposed |
1736
|
| gptkbp:bfsParent |
gptkb:Euler,_Leonhard
|
| gptkbp:bfsLayer |
7
|