The number of labeled dissections of a k-ball

DOI10.1007/BF02330563zbMath0208.52201MaRDI QIDQ2543429

Raymond E. Pippert, Lowell W. Beineke

Publication date: 1971

Published in: Mathematische Annalen (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/162125

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (6)

On the enumeration of planar trees of hexagons ⋮ Neighborly combinatorial 3-manifolds with 9 vertices ⋮ An enumeration of combinatorial 3-manifolds with nine vertices ⋮ Enumeration of chordal planar graphs and maps ⋮ Baxter-Guttman-Jensen conjecture for power series in directed percolation problem ⋮ Patchworks and metablocks enumeration

Cites Work

• Historical Note on a Recurrent Combinatorial Problem
• The number of labeled k-dimensional trees
• Unnamed Item

This page was built for publication: The number of labeled dissections of a k-ball