Twelve countings with rooted plane trees

DOI10.1006/eujc.1995.0095zbMath0868.05017OpenAlexW2094302618MaRDI QIDQ674629

Martin Klazar

Publication date: 18 August 1997

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1995.0095

zbMATH Keywords

plane trees

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15)

Related Items (24)

Enumeration problems for classes of self-similar graphs ⋮ From Madhava–Leibniz to Lehmer’s Limit ⋮ On the number of matchings of a tree ⋮ Greedy trees, subtrees and antichains ⋮ Unnamed Item ⋮ Global forcing number for maximal matchings ⋮ A Riordan group poset ⋮ Refined enumeration of \(k\)-plane trees and \(k\)-noncrossing trees ⋮ Central Limit Theorems for Additive Tree Parameters with Small Toll Functions ⋮ A quantitative study of pure parallel processes ⋮ Counting the maximal and perfect matchings in benzenoid chains ⋮ Ordered partitions and drawings of rooted plane trees ⋮ The butterfly decomposition of plane trees ⋮ The inverse problem for certain tree parameters ⋮ Klazar trees and perfect matchings ⋮ The cycle descent statistic on permutations ⋮ Unnamed Item ⋮ A central limit theorem for almost local additive tree functionals ⋮ Shellability of generalized Dowling posets ⋮ On planar algebras arising from hypergroups. ⋮ Shellability of posets of labeled partitions and arrangements defined by root systems ⋮ A REFINEMENT FOR ORDERED LABELED TREES ⋮ Trees with minimum number of infima closed sets ⋮ Maximal matchings in polyspiro and benzenoid chains

This page was built for publication: Twelve countings with rooted plane trees