A construction for enumerating k-coloured Motzkin paths-Reference-Cited by-同舟云学术

A construction for enumerating k-coloured Motzkin paths

Published:1995 Issue: Volume: Page:254-263
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Barcucci Elena,Del Lungo Alberto,Pergola Elisa,Pinzani Renzo

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0030840

Reference5 articles.

1. Barcucci, E., Del Lungo, A., Pergola, E., Pinzani, R.: Towards a methodology for tree enumeration. Proc. of the 7th FPSAC, Marne-la-Vallée, 1995 (to appear)

2. Bousquet-Mélou, M.: A method for the enumeration of various classes of column-convex polygons. Report LaBRI 378–93, Université Bordeaux I (1993).

3. Flajolet P.: Combinatorial aspects of continued fractions. Discrete Mathematics 32 (1980) 125–161.

4. Donaghey, R., Shapiro, L.: Motzkin numbers. J. Combin. Theory, A 23 (1977) 291–301.

5. Goulden, I. P., Jackson, D. M.: Combinatorial enumeration. John Wiley and Sons, New York (1983).

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Exhaustive generation of some lattice paths and their prefixes;Theoretical Computer Science;2021-07

2. Bijections of Motzkin Paths Using Shifted Riordan Decompositions;Graphs and Combinatorics;2018-11-30

3. Notes on theq-colored Motzkin numbers and Schröder numbers;Journal of Difference Equations and Applications;2017-04-24

4. On directed lattice paths with vertical steps;Discrete Mathematics;2016-03

5. On Computing the Total Displacement Number via Weighted Motzkin Paths;Lecture Notes in Computer Science;2016