A REFINEMENT FOR ORDERED LABELED TREES

DOI10.11568/kjm.2012.20.2.255OpenAlexW2950902570MaRDI QIDQ5863398

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

zbMATH Keywords

refinementmaximal decreasing subtreeordered labeled tree

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Cites Work

• Unnamed Item
• On the enumeration of rooted trees with fixed size of maximal decreasing trees
• Twelve countings with rooted plane trees
• A Ramanujan sequence that refines the Cayley formula for trees
• A new proof of Cayley's formula for counting labeled trees
• A generalized enumeration of labeled trees and reverse Prüfer algorithm
• Recurrence Relations for Strongly q-Log-Convex Polynomials

This page was built for publication: A REFINEMENT FOR ORDERED LABELED TREES