A bijection between ordered trees and bicoloured ordered trees
From MaRDI portal
Publication:1024450
DOI10.1016/J.DISC.2008.02.045zbMATH Open1221.05053OpenAlexW2063502796MaRDI QIDQ1024450FDOQ1024450
Authors: Chun Lin Liu, Zhenghua Wang 
Publication date: 17 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.02.045
Recommendations
- Bijections between bicoloured ordered trees and non-crossing partitions.
- A pairing of the vertices of ordered trees
- Bicoloured ordered trees, non-nesting partitions and non-crossing partitions.
- A bijection between ordered trees and 2-Motzkin paths and its many consequences
- A bijection from ordered trees to binary trees that sends the pruning order to the Strahler number
Cites Work
Cited In (10)
- A combinatorial bijection on di-sk trees
- A pairing of the vertices of ordered trees
- Title not available (Why is that?)
- A bijection between ordered trees and 2-Motzkin paths and its many consequences
- Coding properties of breadth-first search orderings
- Bicoloured ordered trees, non-nesting partitions and non-crossing partitions.
- A bijection from ordered trees to binary trees that sends the pruning order to the Strahler number
- A simple bijection between a subclass of 2-binary trees and ternary trees
- Bijections between bicoloured ordered trees and non-crossing partitions.
- Bijections between formulae and trees which are compatible with equivalences of the type ((f\(\circ g)\circ h)\sim ((f\circ h)\circ g)\)
This page was built for publication: A bijection between ordered trees and bicoloured ordered trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024450)
