On general dissections of a polygon

DOI10.1007/BF03031688zbMath0396.05028MaRDI QIDQ1253257

Ronald C. Read

Publication date: 1978

Published in: Aequationes Mathematicae (Search for Journal in Brave)

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

zbMATH Keywords

General Dissections of a Polygon

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Polyominoes (05B50) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items

On the enumeration of a class of plane multigraphs, Counting unlabelled chord diagrams of maximal genus, The S n+1 Action on Spherical Models and Supermaximal Models of Tipe A n−1, Decompositions of a polygon into centrally symmetric pieces, Circumscribing certain polygonal systems, Combinatorial families enumerated by quasi-polynomials, Counting symmetry classes of dissections of a convex regular polygon, Counting quiddities of polygon dissections, The enumeration of stack polytopes and simplicial clusters, Counting equivalence classes of vertex pairs modulo the dihedral action on the associahedron, Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs

Cites Work

• On the cell-growth problem for arbitrary polygons
• Contributions to the Cell Growth Problem
• On the enumeration of planar trees of hexagons
• Historical Note on a Recurrent Combinatorial Problem
• Cell Growth Problems
• The number of plane trees with a given partition
• 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