On the enumeration of planar trees of hexagons
From MaRDI portal
Publication:4063481
DOI10.1017/S0017089500002305zbMath0306.05115MaRDI QIDQ4063481
Raymond E. Pippert, Lowell W. Beineke
Publication date: 1974
Published in: Glasgow Mathematical Journal (Search for Journal in Brave)
Trees (05C05) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items
A polyominoes-permutations injection and tree-like convex polyominoes ⋮ The growth rate of high-dimensional tree polycubes ⋮ On general dissections of a polygon
Cites Work
- The number of labeled dissections of a k-ball
- The enumeration of tree-like polyhexes
- Enumerating Dissectible Polyhedra by Their Automorphism Groups
- Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
