An insertion algorithm and leaders of rooted trees
From MaRDI portal
Publication:901150
DOI10.1016/j.ejc.2015.10.008zbMath1328.05045OpenAlexW2178237587MaRDI QIDQ901150
Publication date: 23 December 2015
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2015.10.008
Related Items (4)
Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees ⋮ Rooted forests that avoid sets of permutations ⋮ A recursive algorithm for trees and forests ⋮ A bijective proof of the Shor recurrence
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bilabelled increasing trees and hook-length formulae
- Hook length polynomials for plane forests of a certain type
- Enumeration results for alternating tree families
- A refinement of Cayley's formula for trees
- \((k,m)\)-Catalan numbers and hook length polynomials for plane trees
- On Postnikov's hook length formula for binary trees
- A combinatorial proof of {P}ostnikov's identity and a generalized enumeration of labeled trees
- A generalization of the Ramanujan polynomials and plane trees
- A generalized enumeration of labeled trees and reverse Prüfer algorithm
- Disposition polynomials and plane trees
- A unifying approach for proving hook-length formulas for weighted tree families
- Probabilistic proofs of hook length formulas involving trees
- Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees
This page was built for publication: An insertion algorithm and leaders of rooted trees
