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

05C30: Enumeration in graph theory

05C10: Planar graphs; geometric and topological aspects of graph theory

05C99: Graph theory

Related Items

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

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item