The enumeration of stack polytopes and simplicial clusters
From MaRDI portal
Publication:1173286
DOI10.1016/0012-365X(82)90121-2zbMath0503.52006MaRDI QIDQ1173286
Ronald C. Read, Franz Hering, Geoffrey C. Shephard
Publication date: 1982
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
The weak-coupling limit of 3D simplicial quantum gravity, The weak-coupling limit of simplicial quantum gravity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polyhedra with 4 to 8 faces
- On the cell-growth problem for arbitrary polygons
- Subpolytopes of stack polytopes
- On general dissections of a polygon
- Manifolds in stacked 4-polytopes
- The minimum number of vertices of a simple polytope
- The number of trees
- The number of neighbourly d ‐polytopes with d +3 vertices
- Enumeration of polyhedra: The number of 9-hedra
- The number of d ‐polytopes with d +3 vertices
- Enumerating Dissectible Polyhedra by Their Automorphism Groups
- Can Regular Tetrahedra be Glued Together Face to Face to form a Ring?