TOPICS
Search

Steinitz's Theorem


A graph G is the edge graph of a polyhedron iff G is a simple planar graph which is 3-connected.


See also

Connected Graph, Fáry Theorem, Planar Graph, Simple Graph

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Steinitz's Theorem." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/SteinitzsTheorem.html

Subject classifications