A recursive algorithm for trees and forests

DOI10.1016/j.disc.2016.12.012zbMath1355.05083arXiv1702.01744OpenAlexW2569147512MaRDI QIDQ507491

Victor J. W. Guo, Song Guo

Publication date: 6 February 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

plane treesrooted treesforests\(k\)-edge colored treesbipartite treestripartite trees

Mathematics Subject Classification ID

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

Related Items

Trees, forests, and total positivity. I: \(q\)-trees and \(q\)-forests matrices, A remark on the enumeration of rooted labeled trees, Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees, A new simple proof of Cayley's formula and its relationship with the Kirkwood-Salzburg equations

Cites Work

• A bijective enumeration of labeled trees with given indegree sequence
• An insertion algorithm and leaders of rooted trees
• Counting labelled trees with given indegree sequence
• Bijections for Cayley trees, spanning trees, and their q-analogues
• Coalescent random forests
• Incidence algebra antipodes and Lagrange inversion in one and several variables
• A generalization of the Ramanujan polynomials and plane trees
• Disposition polynomials and plane trees
• On Cayley's Formula for Counting Trees
• On $W$-bases of directed graphs
• The Enumeration of Point Labelled Chromatic Graphs and Trees
• A general bijective algorithm for trees.
• Forests of labeled trees
• Proofs from THE BOOK
• Bijections behind the Ramanujan polynomials
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item