On the cell-growth problem for arbitrary polygons

DOI10.1016/0012-365X(75)90041-2zbMath0301.05119MaRDI QIDQ1215640

Frank Harary, Edgar M. Palmer, Ronald C. Read

Publication date: 1975

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (14)

A classification of plane and planar 2-trees ⋮ Some canonical sequences of integers ⋮ Circumscribing certain polygonal systems ⋮ The enumeration of stack polytopes and simplicial clusters ⋮ COLORED QUIVERS OF TYPE A AND THE CELL-GROWTH PROBLEM ⋮ Brown's theorem and its application for enumeration of dissections and planar trees ⋮ The positive geometry for \(\varphi^p\) interactions ⋮ Non-crossing trees, quadrangular dissections, ternary trees, and duality-preserving bijections ⋮ On general dissections of a polygon ⋮ A Partition Theory of Planar Animals ⋮ First-level rotations on the set of plane planted trees ⋮ Labelled and unlabelled enumeration of \(k\)-gonal 2-trees ⋮ An efficient upper bound of the rotation distance of binary trees ⋮ Geometric classification of triangulations and their enumeration in a convex polygon

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dissimilarity Characteristic Theorems for Graphs
• Contributions to the Cell Growth Problem
• Tiling with polyominoes
• On acyclic simplicial complexes
• Cell Growth Problems
• The enumeration of tree-like polyhexes
• Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products

This page was built for publication: On the cell-growth problem for arbitrary polygons