Skip to main content
SpringerLink
Log in

A construction for enumerating k-coloured Motzkin paths

  • Session 4B: Combinatorics
  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 959))

Included in the following conference series:

Abstract

We illustrate a method for enumerating k- coloured Motzkin paths according to various parameters and, we give a recursive description of these paths from which we deduce the k- coloured Motzkin paths' generating function according to their length, area and last fall length.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    Google Scholar 

  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).

    Google Scholar 

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

    Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Sistemi e Informatica, Via Lombroso 6/17, 50134, Firenze, Italy

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

Authors
  1. Elena Barcucci
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alberto Del Lungo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Elisa Pergola
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Renzo Pinzani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ding-Zhu Du Ming Li

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barcucci, E., Del Lungo, A., Pergola, E., Pinzani, R. (1995). A construction for enumerating k-coloured Motzkin paths. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030840

Download citation

  • DOI: https://doi.org/10.1007/BFb0030840

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60216-3

  • Online ISBN: 978-3-540-44733-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation