A bijection between ternary trees and a subclass of Motzkin paths

2018/08/06 by Prodinger, Helmut, Selkirk, Sarah J.
#05A19 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1808.01907

Abstract

A bijection between ternary trees with n nodes and a subclass of Motzkin paths of length 3n is given. This bijection can then be generalized to t-ary trees.

Related

• On two subclasses of Motzkin paths and their relation to ternary trees
• A bijection between two subfamilies of Motzkin paths
• An elementary approach to solve recursions relative to the enumeration of S-Motzkin paths
• Multi-edge trees and 3-coloured Motzkin paths: bijective issues
• Grand Motzkin paths and \0,1,2\-trees -- a simple bijection