An insertion algorithm and leaders of rooted trees
From MaRDI portal
Publication:901150
Recommendations
Cites work
- scientific article; zbMATH DE number 2186866 (Why is no real title available?)
- scientific article; zbMATH DE number 6909312 (Why is no real title available?)
- scientific article; zbMATH DE number 1245629 (Why is no real title available?)
- 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
- A refinement of Cayley's formula for trees
- A unifying approach for proving hook-length formulas for weighted tree families
- Bilabelled increasing trees and hook-length formulae
- Disposition polynomials and plane trees
- Enumeration results for alternating tree families
- Hook length polynomials for plane forests of a certain type
- On Postnikov's hook length formula for binary trees
- Postnikov identities and Seo's formulas
- Probabilistic proofs of hook length formulas involving trees
- Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees
- \((k,m)\)-Catalan numbers and hook length polynomials for plane trees
Cited in
(5)
This page was built for publication: An insertion algorithm and leaders of rooted trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q901150)