Maximal dissections of a simplex

DOI10.1016/0097-3165(76)90018-2zbMath0334.05011OpenAlexW2018297584MaRDI QIDQ1228482

Thomas Zaslavsky

Publication date: 1976

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(76)90018-2

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Polyhedra and polytopes; regular figures, division of spaces (51M20) Designs and configurations (05B99) Polytopes and polyhedra (52Bxx)

Related Items

A combinatorial analysis of topological dissections

Cites Work

• Unnamed Item
• A combinatorial analysis of topological dissections
• Dissections of a tetrahedron
• The number of labeled k-trees
• Dissections of a simplex