A pairing of the vertices of ordered trees

DOI10.1016/S0012-365X(01)00130-3MaRDI QIDQ5951955zbMATH OpenOpenAlexFDO

Authors Seung-Hyun Seo

Publication date 14 August 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(01)00130-3

zbMATH Keywords

Catalan numbersDyck pathsordered treesroots

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Trees (05C05)

Recommendations

• A bijection between ordered trees and bicoloured ordered trees
• Enumerations of vertices among all rooted ordered trees with levels and degrees
• A bijection from ordered trees to binary trees that sends the pruning order to the Strahler number
• Bijections between bicoloured ordered trees and non-crossing partitions.
• A simple bijection between a subclass of 2-binary trees and ternary trees

Cited in

(6)

• A bijection between ordered trees and bicoloured ordered trees
• Bijections between formulae and trees which are compatible with equivalences of the type ((f g) h) ((f h) g)
• Weakly increasing trees on a multiset
• The butterfly decomposition of plane trees
• scientific article; zbMATH DE number 5919782 (Why is no real title available?)
• Klazar trees and perfect matchings

This page was built for publication: A pairing of the vertices of ordered trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5951955)