Brown's theorem and its application for enumeration of dissections and planar trees
From MaRDI portal
Publication:2256111
Recommendations
Cites work
- scientific article; zbMATH DE number 194009 (Why is no real title available?)
- scientific article; zbMATH DE number 3468863 (Why is no real title available?)
- scientific article; zbMATH DE number 1111371 (Why is no real title available?)
- scientific article; zbMATH DE number 3419161 (Why is no real title available?)
- A Census of Planar Triangulations
- A classification of plane and planar 2-trees
- Analytic combinatorics
- Enumeration of Quadrangular Dissections of the Disk
- Enumeration of Triangulations of the Disk
- Enumerative combinatorics. Volume 2.
- On the cell-growth problem for arbitrary polygons
- 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 trees
- Triangular Dissections of N-Gons
- Une théorie combinatoire des séries formelles
This page was built for publication: Brown's theorem and its application for enumeration of dissections and planar trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256111)