Show simple item record

dc.contributor.authorGrünbaum, Branko
dc.date.accessioned2006-01-18T21:41:23Z
dc.date.available2006-01-18T21:41:23Z
dc.date.issued2005
dc.identifier.urihttp://hdl.handle.net/1773/2276
dc.description.abstractRelations 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.extent1502762 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.subjectSteinitz' theoremen
dc.subjectPolygonen
dc.subjectabstract polyhedronen
dc.subjectpolyhedronen
dc.titleGraphs of polyhedra; polyhedra as graphsen
dc.typeArticleen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record