Twelve countings with rooted plane trees
From MaRDI portal
Publication:674629
DOI10.1006/EUJC.1995.0095zbMATH Open0868.05017OpenAlexW2094302618MaRDI QIDQ674629FDOQ674629
Authors: 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
Recommendations
Cited In (27)
- Counting mutations and anti-chains in complete binary trees
- Trees with minimum number of infima closed sets
- A central limit theorem for almost local additive tree functionals
- Maximal matchings in polyspiro and benzenoid chains
- Greedy trees, subtrees and antichains
- The cycle descent statistic on permutations
- From Madhava-Leibniz to Lehmer's limit
- A REFINEMENT FOR ORDERED LABELED TREES
- Central limit theorems for additive tree parameters with small toll functions
- Refined enumeration of \(k\)-plane trees and \(k\)-noncrossing trees
- Ordered partitions and drawings of rooted plane trees
- On planar algebras arising from hypergroups.
- Subset counting in trees
- THE EXFECTED INDEPENDENT DOMINATION NUMBER OF TWO TYPES OF TREES
- A quantitative study of pure parallel processes
- Asymptotic normality of almost local functionals in conditioned Galton-Watson trees
- Klazar trees and perfect matchings
- The butterfly decomposition of plane trees
- Counting the maximal and perfect matchings in benzenoid chains
- Enumeration problems for classes of self-similar graphs
- On the number of matchings of a tree
- The inverse problem for certain tree parameters
- Title not available (Why is that?)
- Shellability of generalized Dowling posets
- Shellability of posets of labeled partitions and arrangements defined by root systems
- Global forcing number for maximal matchings
- A Riordan group poset
This page was built for publication: Twelve countings with rooted plane trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674629)
