Disposition polynomials and plane trees

DOI10.1016/j.ejc.2013.05.029zbMath1284.05060arXiv1208.2139OpenAlexW2014412637MaRDI QIDQ2441620

Janet F. F. Peng, William Y. C. Chen

Publication date: 25 March 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.2139

zbMATH Keywords

disposition polynomialgenerating function of plane trees

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (3)

An insertion algorithm and leaders of rooted trees ⋮ A recursive algorithm for trees and forests ⋮ A bijective proof of the Shor recurrence

Cites Work

• A refinement of Cayley's formula for trees
• From sets to functions: Three elementary examples
• A generalization of the Ramanujan polynomials and plane trees
• A generalized enumeration of labeled trees and reverse Prüfer algorithm
• Unnamed Item
• Unnamed Item

This page was built for publication: Disposition polynomials and plane trees