Title of article
2-Binary trees: Bijections and related issues Original Research Article
Author/Authors
Nancy S.S. Gu، نويسنده , , Nelson Y. Li، نويسنده , , Toufik Mansour، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
13
From page
1209
To page
1221
Abstract
A 2-binary tree is a binary rooted tree whose root is colored black and the other vertices are either black or white. We present several bijections concerning different types of 2-binary trees as well as other combinatorial structures such as ternary trees, non-crossing trees, Schröder paths, Motzkin paths and Dyck paths. We also obtain a number of enumeration results with respect to certain statistics.
Keywords
Non-crossing tree , Dyck path , Schr?der path , Motzkin path , Binary tree , Ternary tree
Journal title
Discrete Mathematics
Serial Year
2008
Journal title
Discrete Mathematics
Record number
947433
Link To Document