Recommendations
Cited in
(27)- Maximal matchings in polyspiro and benzenoid chains
- Counting mutations and anti-chains in complete binary trees
- Ordered partitions and drawings of rooted plane trees
- From Madhava-Leibniz to Lehmer's limit
- Shellability of posets of labeled partitions and arrangements defined by root systems
- A REFINEMENT FOR ORDERED LABELED TREES
- A central limit theorem for almost local additive tree functionals
- Enumeration problems for classes of self-similar graphs
- On the number of matchings of a tree
- A quantitative study of pure parallel processes
- Trees with minimum number of infima closed sets
- Central limit theorems for additive tree parameters with small toll functions
- On planar algebras arising from hypergroups.
- Klazar trees and perfect matchings
- Greedy trees, subtrees and antichains
- Counting the maximal and perfect matchings in benzenoid chains
- The butterfly decomposition of plane trees
- The cycle descent statistic on permutations
- The inverse problem for certain tree parameters
- Global forcing number for maximal matchings
- scientific article; zbMATH DE number 7583268 (Why is no real title available?)
- Shellability of generalized Dowling posets
- A Riordan group poset
- Asymptotic normality of almost local functionals in conditioned Galton-Watson trees
- Subset counting in trees
- THE EXFECTED INDEPENDENT DOMINATION NUMBER OF TWO TYPES OF TREES
- Refined enumeration of \(k\)-plane trees and \(k\)-noncrossing trees
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)
