A bijection between ordered trees and bicoloured ordered trees
From MaRDI portal
(Redirected from Publication:1024450)
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
- scientific article; zbMATH DE number 3989356 (Why is no real title available?)
- scientific article; zbMATH DE number 1080074 (Why is no real title available?)
- A correspondence between ordered trees and noncrossing partitions
- A new bijection between ordered trees and legal bracketings
- Ordered trees and non-crossing partitions
- Six etudes in generating functions
Cited in
(10)- A combinatorial bijection on di-sk trees
- A pairing of the vertices of ordered trees
- scientific article; zbMATH DE number 1919510 (Why is no real title available?)
- A bijection between ordered trees and 2-Motzkin paths and its many consequences
- Coding properties of breadth-first search orderings
- A bijection from ordered trees to binary trees that sends the pruning order to the Strahler number
- Bicoloured ordered trees, non-nesting partitions and non-crossing partitions.
- 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 g) h) ((f h) 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)
