A REFINEMENT FOR ORDERED LABELED TREES
From MaRDI portal
Publication:5863398
Recommendations
- On the enumeration of rooted trees with fixed size of maximal decreasing trees
- A REFINED ENUMERATION OF p-ARY LABELED TREES
- Bijections on rooted trees with fixed size of maximal decreasing subtrees
- Refined enumeration of vertices among all rooted ordered \(d\)-trees
- Ordered trees and the inorder traversal
Cites work
- scientific article; zbMATH DE number 1431596 (Why is no real title available?)
- A Ramanujan sequence that refines the Cayley formula for trees
- A generalized enumeration of labeled trees and reverse Prüfer algorithm
- A new proof of Cayley's formula for counting labeled trees
- On the enumeration of rooted trees with fixed size of maximal decreasing trees
- Recurrence relations for strongly \(q\)-log-convex polynomials
- Twelve countings with rooted plane trees
Cited in
(9)- On the complexity of labeled oriented trees
- scientific article; zbMATH DE number 6473239 (Why is no real title available?)
- Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees
- A Framework for Succinct Labeled Ordinal Trees over Large Alphabets
- A refinement for ordered labeled trees
- Gracefully labeled trees from Skolem sequences
- scientific article; zbMATH DE number 3917747 (Why is no real title available?)
- scientific article; zbMATH DE number 5919782 (Why is no real title available?)
- A generalized enumeration of labeled trees and reverse Prüfer algorithm
This page was built for publication: A REFINEMENT FOR ORDERED LABELED TREES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5863398)
