Brown's theorem and its application for enumeration of dissections and planar trees
From MaRDI portal
Publication:2256111
zbMath1307.05117MaRDI QIDQ2256111
Evgeniy Krasko, Alexander Omelchenko
Publication date: 19 February 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i1p17
Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Une théorie combinatoire des séries formelles
- On the cell-growth problem for arbitrary polygons
- A classification of plane and planar 2-trees
- The number of trees
- A Census of Planar Triangulations
- Enumeration of Triangulations of the Disk
- Enumeration of Quadrangular Dissections of the Disk
- Triangular Dissections of N-Gons
- 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: Brown's theorem and its application for enumeration of dissections and planar trees