A methodology for plane tree enumeration

DOI10.1016/S0012-365X(97)00122-2zbMath0904.05004MaRDI QIDQ1381812

Elisa Pergola, Renzo Pinzani, Elena Barcucci, Alberto del Lungo

Publication date: 11 January 1999

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

partitiongenerating functionsenumerationplane trees

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Related Items (15)

Subregularity in infinitely labeled generating trees of restricted permutations ⋮ ANISOTROPIC STEP, SURFACE CONTACT, AND AREA WEIGHTED DIRECTED WALKS ON THE TRIANGULAR LATTICE ⋮ Nondecreasing Dyck paths and \(q\)-Fibonacci numbers ⋮ Solving multivariate functional equations ⋮ A construction for enumerating k-coloured Motzkin paths ⋮ Production matrices and riordan arrays ⋮ Ranking and unranking of non-regular trees with a prescribed branching sequence ⋮ Production matrices ⋮ ECO:a methodology for the enumeration of combinatorial objects ⋮ Bounds on the number of numerical semigroups of a given genus ⋮ Left ternary trees and non-separable rooted planar maps ⋮ Random generation of trees and other combinatorial objects ⋮ Steep polyominoes, \(q\)-Motzkin numbers and \(q\)-Bessel functions ⋮ Directed animals, forests and permutations ⋮ Some combinatorial interpretations of \(q\)-analogs of Schröder numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Restricted plane tree representations of four Motzkin-Catalan equations
• A method for the enumeration of various classes of column-convex polygons
• Motzkin numbers

This page was built for publication: A methodology for plane tree enumeration