A new bijection on rooted forests

DOI10.1016/0012-365X(93)90154-LzbMath0785.05049OpenAlexW2125713096MaRDI QIDQ686461

Péter L. Erdős

Publication date: 20 December 1993

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90154-l

zbMATH Keywords

partitionsenumerationbijectionforestssemilabelled tree

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (4)

Labellable phylogenetic networks ⋮ Counting and enumerating galled networks ⋮ Core forging and local limit theorems for the \(k\)-core of random graphs ⋮ Counting bichromatic evolutionary trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Applications of antilexicographic order. I: An enumerative theory of trees
• Extremal problems for finite sets and convex hulls---a survey
• The Enumeration of Trees by Height and Diameter
• On the Distribution of Lengths of Evolutionary Trees
• Inverse Relations and Combinatorial Identities
• Forests of labeled trees

This page was built for publication: A new bijection on rooted forests