Enumerating Dissectible Polyhedra by Their Automorphism Groups

DOI10.4153/CJM-1974-006-XMaRDI QIDQ5646922zbMATH OpenFDO

Authors L. W. Beineke, Raymond E. Pippert

Publication date 1974

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CJM-1974-006-X

Mathematics Subject Classification ID

Trees (05C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Enumeration in graph theory (05C30) Triangulating manifolds (57Q15)

Cited in

(3)

• The enumeration of stack polytopes and simplicial clusters
• On the enumeration of planar trees of hexagons
• Cubic graphs with edges in exactly one perfect matching

This page was built for publication: Enumerating Dissectible Polyhedra by Their Automorphism Groups

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