Brown's theorem and its application for enumeration of dissections and planar trees

zbMATH Open1307.05117MaRDI QIDQ2256111FDOQ2256111

Alexander V. Omelchenko, Evgeniy Krasko

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• scientific article
• Publication:4206757
• scientific article; zbMATH DE number 3918402
• Counting polygon dissections in the projective plane
• Counting symmetry classes of dissections of a convex regular polygon

zbMATH Keywords

enumerationplane treesplanar dissections

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Enumerative combinatorics. Volume 2.
• Title not available (Why is that?)
• Title not available (Why is that?)
• The number of trees
• Une théorie combinatoire des séries formelles
• A Census of Planar Triangulations
• Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
• Enumeration of Triangulations of the Disk
• Triangular Dissections of N-Gons
• Enumeration of Quadrangular Dissections of the Disk
• On the cell-growth problem for arbitrary polygons
• A classification of plane and planar 2-trees
• Title not available (Why is that?)

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)