The following pages link to A new bijection on rooted forests (Q686461):
Displaying 15 items.
- Bijections on rooted trees with fixed size of maximal decreasing subtrees (Q360359) (← links)
- A bijective enumeration of labeled trees with given indegree sequence (Q616443) (← links)
- Bilabelled increasing trees and hook-length formulae (Q658008) (← links)
- Applications of antilexicographic order. I: An enumerative theory of trees (Q757391) (← links)
- Counting bichromatic evolutionary trees (Q1314318) (← links)
- A family of invariants of rooted forests. (Q1426341) (← links)
- Rooted forests that avoid sets of permutations (Q1715620) (← links)
- Möbius coinvariants and bipartite edge-rooted forests (Q1750218) (← links)
- Two bijections on weakly increasing trees (Q2075513) (← links)
- Counting and enumerating galled networks (Q2192120) (← links)
- Core forging and local limit theorems for the \(k\)-core of random graphs (Q2312608) (← links)
- Increasing forests and quadrangulations via a bijective approach (Q2341255) (← links)
- A general bijective algorithm for trees. (Q3487361) (← links)
- On the rooted forests in triangulated closed manifolds (Q5132624) (← links)
- Labellable phylogenetic networks (Q6044240) (← links)
