ResearchWorks Archive

Graphs of polyhedra; polyhedra as graphs

Show simple item record Grünbaum, Branko 2006-01-18T21:41:23Z 2006-01-18T21:41:23Z 2005
dc.description.abstract Relations between graph theory and polyhedra are presented in two contexts. In the first, the symbiotic dependence between 3-connected planar graphs and convex polyhedra is described in detail. In the second, a theory of nonconvex polyhedra is based on a graph-theoretic foundation. This approach eliminates the vagueness and inconsistency that pervade much of the literature dealing with polyhedra more general than the convex ones. en
dc.format.extent 1502762 bytes
dc.format.mimetype application/pdf
dc.language.iso en_US
dc.subject Steinitz' theorem en
dc.subject Polygon en
dc.subject abstract polyhedron en
dc.subject polyhedron en
dc.title Graphs of polyhedra; polyhedra as graphs en
dc.type Article en

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search ResearchWorks

Advanced Search


My Account