Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
convex polyhedra
|
| gptkbp:describes |
characterization of 3-connected planar graphs
|
| gptkbp:field |
gptkb:geometry
gptkb:mathematics graph theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Steinitz's theorem
|
| gptkbp:importantFor |
fundamental theorem in polyhedral theory
|
| gptkbp:namedAfter |
gptkb:Ernst_Steinitz
|
| gptkbp:publishedIn |
gptkb:Mathematische_Annalen
|
| gptkbp:relatedTo |
3-connected graphs
planar graphs polyhedral combinatorics |
| gptkbp:state |
A graph is the edge-vertex graph of a convex 3-dimensional polyhedron if and only if it is planar and 3-connected.
|
| gptkbp:usedIn |
characterization of convex polyhedra
graph drawing topological graph theory |
| gptkbp:yearProposed |
1922
|
| gptkbp:bfsParent |
gptkb:Ernst_Steinitz
|
| gptkbp:bfsLayer |
4
|