W.Y.C. Chen,
A general bijective algorithm for increasing tress,
Syst. Sci. Math. Sci. 12 (1999) 193-203.

Cited by

  1. S. Caminiti and R. Petreschi, Parallel algorithms for dandelion-like codes, In: Computational Science-ICCS 2009, 611-620, Springer-Verlag Berlin Heidelberg, 2009.

  2. W.Y.C. Chen, T. Mansour and S.H.F. Yan, Matchings avoiding partial patterns, Electron. J. Combin. 13 (2006) Research Paper 112, 17 pp.

  3. W.Y.C.Chen and S.H.F. Yan, Noncrossing trees and noncrossing graphs, Electron. J. Combin. 13 (2006) Note 12, 8 pp.

  4. R.R.X. Du and F. Liu, (k, m)-Catalan numbers and hook length polynomials for plane trees, European J. Combin. 28 (2007) 1312-1321.

  5. S. Heubach, N.Y. Li and T. Mansour, A garden of k-Catalan structures, Preprint.

  6. S. Heubach, N.Y. Li and T. Mansour, Staircase tilings and k-catalan structures, Discrete Math. 308 (2008) 5954-5964.

  7. T. Mansour and Y.D. Sun, Bell polynomials and k-generalized Dyck paths, Discrete Appl. Math. 156 (2008) 2279-2292.

  8. T. Mansour and Y.D. Sun, Dyck paths and partial Bell polynomials, Australas. J. Combin. 42 (2008) 285-297.