Pages that link to "Item:Q2721872"
From MaRDI portal
The following pages link to A general bijective algorithm for increasing trees (Q2721872):
Displaying 10 items.
- \((k,m)\)-Catalan numbers and hook length polynomials for plane trees (Q875066) (← links)
- Bell polynomials and \(k\)-generalized Dyck paths (Q947112) (← links)
- Staircase tilings and \(k\)-Catalan structures (Q998328) (← links)
- The pessimistic search and the straightening involution for trees (Q1266368) (← links)
- A bijection of plane increasing trees with relaxed binary trees of right height at most one (Q1725684) (← links)
- Two bijections on weakly increasing trees (Q2075513) (← links)
- An involution on increasing trees (Q2329198) (← links)
- Increasing forests and quadrangulations via a bijective approach (Q2341255) (← links)
- A general bijective algorithm for trees. (Q3487361) (← links)
- Increasing trees and alternating permutations (Q4872714) (← links)
