Euler's theorem in combinatorics
GPTKB entity
Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Euler's_formula_for_planar_graphs
|
| gptkbp:appliesTo |
planar graphs
|
| gptkbp:field |
gptkb:combinatorics
|
| gptkbp:generalizes |
gptkb:Euler_characteristic
|
| gptkbp:namedAfter |
gptkb:Leonhard_Euler
|
| gptkbp:publishedIn |
gptkb:Leonhard_Euler's_1752_paper
|
| gptkbp:relatedTo |
edges
vertices faces |
| gptkbp:sentence |
For any finite, connected, planar graph, V - E + F = 2
|
| gptkbp:usedIn |
gptkb:topology
graph theory polyhedral combinatorics |
| gptkbp:bfsParent |
gptkb:Euler,_Leonhard
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Euler's theorem in combinatorics
|