2-Binary trees: Bijections and related issues
Authors:
- Nancy S.S. GuNGNancy S.S. Gu
- Nelson Y. LiNLNelson Y. Li
- Toufik MansourTMToufik Mansour
- 1 April 2008
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 308 (7) , 1209-1221
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Noncrossing Trees and Noncrossing GraphsThe Electronic Journal of Combinatorics, 2006
- Descents in Noncrossing TreesThe Electronic Journal of Combinatorics, 2003
- Diagonally convex directed polyominoes and even trees: a bijection and related issuesDiscrete Mathematics, 2002
- Statistics on non-crossing treesDiscrete Mathematics, 2002
- A bijective proof of the equation linking the Schröder numbers, large and smallDiscrete Mathematics, 2001
- Analytic combinatorics of non-crossing configurationsDiscrete Mathematics, 1999
- Dyck path enumerationDiscrete Mathematics, 1999
- Catalan Numbers, Their Generalization, and Their UsesThe Mathematical Intelligencer, 1991
- Trees and Hierarchical Structures1990
- Enumerations of ordered treesDiscrete Mathematics, 1980