Maximal dissections of a simplex

DOI10.1016/0097-3165(76)90018-2zbMATH Open0334.05011OpenAlexW2018297584MaRDI QIDQ1228482FDOQ1228482

Authors: 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) Polytopes and polyhedra (52Bxx) Polyhedra and polytopes; regular figures, division of spaces (51M20) Designs and configurations (05B99)

Cites Work

• Title not available (Why is that?)
• The number of labeled k-trees
• A combinatorial analysis of topological dissections
• Dissections of a tetrahedron
• Dissections of a simplex

Cited In (1)

• A combinatorial analysis of topological dissections

This page was built for publication: Maximal dissections of a simplex

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1228482)