A REFINEMENT FOR ORDERED LABELED TREES
From MaRDI portal
Publication:5863398
DOI10.11568/KJM.2012.20.2.255OpenAlexW2950902570MaRDI QIDQ5863398FDOQ5863398
Authors: Heesung Shin, Seung-Hyun Seo 
Publication date: 11 March 2022
Published in: Korean Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.3291
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
- A new proof of Cayley's formula for counting labeled trees
- Recurrence relations for strongly \(q\)-log-convex polynomials
- A generalized enumeration of labeled trees and reverse Prüfer algorithm
- On the enumeration of rooted trees with fixed size of maximal decreasing trees
- A Ramanujan sequence that refines the Cayley formula for trees
- Twelve countings with rooted plane trees
- Title not available (Why is that?)
Cited In (9)
- On the complexity of labeled oriented trees
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Gracefully labeled trees from Skolem sequences
- Title not available (Why is that?)
- 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)
