c*******h
发帖数: 1096 | 1 I am making a citation of Steinitz theorem saying that a graph G is
the edge graph of a polyhedron iff G is a simple planar graph which
is 3-connected, but I don't know where does theorem come from. I am
not a graph or combinatorics guy, and could anyone please point me
out a book that introduces this theorem? Thanks |
|
