Some problems on polyhedra

DOI10.1007/BF01225208zbMath0618.52004MaRDI QIDQ1822357

Geoffrey C. Shephard, Branko Grünbaum

Publication date: 1987

Published in: Journal of Geometry (Search for Journal in Brave)

zbMATH Keywords

isomorphismcombinatorial equivalenceduality of polyhedraopen problems on convex polyhedra in Euclidean 3-space

Mathematics Subject Classification ID

Polytopes and polyhedra (52Bxx)

Related Items (12)

Scribability problems for polytopes ⋮ Coin graphs, polyhedra, and conformal mapping ⋮ Graph-theoretical conditions for inscribability and Delaunay realizability ⋮ Unnamed Item ⋮ COMBINATORIAL INSCRIBABILITY OBSTRUCTIONS FOR HIGHER DIMENSIONAL POLYTOPES ⋮ Realizability of Delaunay triangulations ⋮ Note on inscribability of quadrangular polyhedra with restricted number of edge-types ⋮ A unique representation of polyhedral types. Centering via Möbius transformations ⋮ Weakly inscribed polyhedra ⋮ Toughness and Delaunay triangulations ⋮ How to cage an egg ⋮ An upper bound on the shortness exponent of 1-tough, maximal planar graphs

Cites Work

• Twenty Problems on Convex Polyhedra Part I
• Polytopes, graphs, and complexes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some problems on polyhedra