W.Y.C. Chen, S.X.M. Pang, E.X.Y. Qu and R.P. Stanley,
Pairs of noncrossing free Dyck paths and noncrossing partitions,
Discrete Math. 309(9) (2009) 2834-2838.

Cited by

  1. S. Burrill, Crossings and nestings in four combinatorial families, Master thesis, Simon Fraser University, 2009.

  2. W.Y.C. Chen, D.Q.J. Dou and T.Y.J. Zhang, On three and four vicious walkers, J. Statist. Plann. Inference 141 (2011) 94-101.

  3. L. Ferraria and E. Munarini, Enumeration of chains and saturated chains in Dyck lattices, Adv. in Appl. Math. 62 (2015) 118-140.

  4. A. Kudtarkar, R. Sonkusare and D. Ambawade, A spindle graph based singular multipath routing using Labelle Merging Algorithm, In: 2014 International Conference on Control, Instrumentation, Communication and Computational Technologies (ICCICCT), 2014.

  5. P. Mortimer, Lattice path enumeration on restricted domains, Ph.D. Thesis, Queen Mary University of London, 2015.

  6. P.R.G. Mortimer and T. Prellberg, A bijection on blateral Dyck paths, Australas. J. Combin. 59 (2014) 72-80.

  7. H. Mühle, Counting proper mergings of chains and antichains, Discrete Math. 37 (2014) 118-129.

  8. J.O. Tirrell, Orthogonal polynomials, lattice paths, and skew Young tableaux, Ph.D. Thesis, Brandeis University, 2016.