Assertion: euclidean graph | /r/HasProperty | 3-vertex-connected
Facets:
value: according to steinitz's theorem
type: OTHER
Source sentences:
text: According to Steinitz's theorem, every polyhedral graph (the graph formed by the vertices and edges of a three-dimensional convex polyhedron) must be planar and 3-vertex-connected, and every 3-vertex-connected planar graph comes from a convex polyhedron in this way.