Bijections for ternary trees and non-crossing trees

DOI10.1016/S0012-365X(01)00282-5zbMath1010.05018WikidataQ127087532 ScholiaQ127087532MaRDI QIDQ1613443

Alois Panholzer, Prodinger, Helmut

Publication date: 29 August 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

treesbijections

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Related Items (17)

A unifying approach for proving hook-length formulas for weighted tree families ⋮ Turing patterns of an si epidemic model with cross-diffusion on complex networks ⋮ New production matrices for geometric graphs ⋮ Consecutive pattern avoidances in non-crossing trees ⋮ Locally oriented noncrossing trees ⋮ A decomposition algorithm for noncrossing trees ⋮ A refinement of leaves on noncrossing trees ⋮ Unnamed Item ⋮ Dyck paths with coloured ascents ⋮ 2-binary trees: bijections and related issues ⋮ Single polygon counting on Cayley tree of order 3 ⋮ Unnamed Item ⋮ Staircase tilings and \(k\)-Catalan structures ⋮ On Two Subclasses of Motzkin Paths and Their Relation to Ternary Trees ⋮ Bijections for 2-plane trees and ternary trees ⋮ Decomposition and merging algorithms for noncrossing forests ⋮ 2-noncrossing trees and 5-ary trees

This page was built for publication: Bijections for ternary trees and non-crossing trees