Topic summary
K-vertex-connected graph
Extracted from the Wikipedia article Vertex connectivity.
Polyhedral combinatorics
The 1-skeleton of any k-dimensional convex polytope forms a k-vertex-connected graph (Balinski's theorem). As a partial converse, Steinitz's theorem states that any 3-vertex-connected planar graph forms the skeleton of a convex polyhedron.