Two bijections on weakly increasing trees
From MaRDI portal
Publication:2075513
DOI10.1016/j.disc.2021.112760zbMath1482.05041OpenAlexW4200075053MaRDI QIDQ2075513
Publication date: 14 February 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2021.112760
Related Items (1)
Cites Work
- Unnamed Item
- Old and young leaves on plane trees
- Counting vertices with given outdegree in plane trees and \(k\)-ary trees
- A bijection on ordered trees and its consequences
- Weakly increasing trees on a multiset
- Enumerations of vertices among all rooted ordered trees with levels and degrees
- Handbook of Enumerative Combinatorics
- Refined enumeration of vertices among all rooted ordered $d$-trees
This page was built for publication: Two bijections on weakly increasing trees