Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:concerns |
3-connected graphs
triangulations of 2-manifolds |
| gptkbp:excludes |
gptkb:K_5
K_{3,3} triangular prism graph |
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Walkup's theorem
|
| gptkbp:namedAfter |
David Walkup
|
| gptkbp:publicationYear |
1970
|
| gptkbp:publishedIn |
gptkb:Journal_of_Combinatorial_Theory
|
| gptkbp:state |
Every 3-connected graph with at least 6 vertices is the 1-skeleton of a unique triangulation of a 2-manifold, except for K_{3,3}, K_5, and the triangular prism graph.
|
| gptkbp:bfsParent |
gptkb:D._W._Walkup
|
| gptkbp:bfsLayer |
8
|