On general dissections of a polygon
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3494318 (Why is no real title available?)
- scientific article; zbMATH DE number 3448641 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3308309 (Why is no real title available?)
- scientific article; zbMATH DE number 3349816 (Why is no real title available?)
- scientific article; zbMATH DE number 3419161 (Why is no real title available?)
- Cell Growth Problems
- Contributions to the Cell Growth Problem
- Historical Note on a Recurrent Combinatorial Problem
- On the cell-growth problem for arbitrary polygons
- On the enumeration of planar trees of hexagons
- Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
- The number of plane trees with a given partition
Cited in
(11)- The enumeration of stack polytopes and simplicial clusters
- Combinatorial families enumerated by quasi-polynomials
- Counting unlabelled chord diagrams of maximal genus
- Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs
- Decompositions of a polygon into centrally symmetric pieces
- Circumscribing certain polygonal systems
- Counting symmetry classes of dissections of a convex regular polygon
- The \(S_{n+1}\) action on spherical models and supermaximal models of tipe \(A_{n-1}\)
- Counting quiddities of polygon dissections
- Counting equivalence classes of vertex pairs modulo the dihedral action on the associahedron
- On the enumeration of a class of plane multigraphs
This page was built for publication: On general dissections of a polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1253257)
