Catalan, Motzkin, and Riordan numbers

Discrete Mathematics

Volumn 204, Issue 1-3, 1999, Pages 73-112

  Bernhart, Frank R ^a  

^a NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003124224     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(99)00054-0     Document Type: Article

References (47)

1. G. Almkvist, W. Dicks, E. Formanek, Hilbert series of fixed free algebras and noncommutative classical invariant theory, J. Algebra 93 (1) (1985) 189-214.
2. D.L. Andrews, T. Thirunamachandran, On three-dimensional rotational averages, J. Chem. Phys. 67 (11) (1977) 5026-5033.
3. E. Barcucci, R. Pinzani, R. Sprugnoli, The Motzkin family, Pure Math. Appl. Ser. A 2 (3-4) (1991) 249-279.
4. A. Bernhart, Six rings in minimal five color maps, Amer. J. Math. 69 (1947) 391-412.
5. A. Bernhart, Chromatic equations, in: Bondy, Murty (Eds.), Graph Theory and Related Topics, Academic Press, New York, 1979.
6. F. Bernhart, P.C. Kainen, The book thickness of a graph, J. Combin. Theory Ser. B 27 (1979) 320-331.
7. F. Bernhart, Some classes of N-ring graphs, in preparation.
8. N. Biggs, Algebraic Graph Theory, 2nd ed., Cambridge University Press, Cambridge, 1993.
9. G.D. Birkhoff, The reducibility of maps, Amer. J. Math. 35 (1913) 115-128.
10. G.D. Birkhoff, D.C. Lewis, Chromatic polynomials, Trans. Amer. Math. Soc. 60 (1946) 341-355.
11. W.G. Brown, Historical note on a recurrent combinatorial problem, Amer. Math. Monthly 72 (9) (1965) 973-977.
12. R. Chapman, Moments of Dyck paths, Discrete Math. 204 (this Vol.) (1999) 113-117.
13. F.R.K. Chung, F.T. Leighton, A.L. Rosenberg, Embedding graphs in books: a layout problem with applications to VLSI design, SIAM J. Algebra Discrete Meth. 8 (1) (1987) 33-58.
14. J.H. Conway, H.S.M. Coxeter, Triangulated polygons and frieze patterns, Math. Gazette 57 (1973) 87-94, 175-183.
15. N.G. de Bruijn, B.J.M. Morselt, A note on plane trees, J. Combin. Theory Ser. 2 (1967) 27-34.
16. E. Deutsch, Dyck path enumeration, Discrete Math. 204 (this Vol.) (1999) 167-202.
17. C. Domb, A.J. Barrett, Enumeration of ladder graphs, Discrete Math. 9 (1974) 341-358.
18. R. Donaghey, Restricted plane tree representations of four Motzkin-Catalan equations, J. Combin. Theory (A) 22 (1977) 114-121.
19. R. Donaghey, Automorphisms on Catalan trees and bracketings, J. Combin. Theory (B) 29 (1980) 75-90.
20. R. Donaghey, L.W. Shapiro, Motzkin numbers, J. Combin. Theory (A) 23 (3) (1977) 291-301.
21. A. Errera, Un problème d'énumération, Mém. Acad. Royale Bruxelles 8° (2) 11 (6) (1931).
22. H.W. Gould, Research Bibliography of Two Special Sequences, Rev. ed., Combin. Research Institute, Morgantown, West Virginia, 1977.
23. I.P. Goulden, D.M. Jackson, Combinatorial Enumeration, Wiley, New York, 1983.
24. D.W. Hall, D.C. Lewis, Coloring six-rings, Trans. Amer. Math. Soc. 64 (1948) 184-191.
25. Ph. Hanlon, Counting interval graphs, Trans. Amer. Math. Soc. 272 (2) (1982) 383-426.
26. St.J.G. Kettle, A class of natural bijections between Catalan families, in: E.J. Billington, Sh. Oates-Williams, A.P. Street (Eds.), Combinatorial Mathematics, Proc. 9th Australian Conf. on Combin. Math., Univ. Queensland, Brisbane, Australia, Aug. 24-28, 1981, Lecture Notes in Math., Vol. 952, Springer, Berlin, 1982, pp. 327-348.
27. T. Motzkin, Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for nonassociative products, Bull. Amer. Math. Soc. 54 (1948) 352-360.
28. H. Prodinger, A correspondence between ordered trees and noncrossing partitions, Discrete Math. 46 (1983) 205-206.
29. R.C. Read, An introduction to chromatic polynomials, J. Combin. Theory 4 (1968) 52-71.
30. R.C. Read, W.T. Tutte, Chromatic polynomials, in: L.W. Beineke, R.J. Wilson (Eds.), Selected Topics in Graph Theory, vol. 3, Academic Press, London, 1988, pp. 15-42.
31. J. Riordan, Enumeration of plane trees by branches and endpoints, J. Combin. Theory (A) 19 (1975) 214-222.
32. D.G. Rogers, Similarity relations on finite ordered sets, J. Combin. Theory Ser. A 23 (1977) 88-98.
33. D.G. Rogers, The enumeration of a family of ladder graphs, Part I: connective relations, Quart. J. Math. Oxford 28 (1977) 421-431.
34. D.G. Rogers, The enumeration of a family of ladder graphs, Part II: Schröder and superconnective relations, Quart. J. Math. Oxford 31 (1980) 491-506.
35. D.G. Rogers, Rhyming schemes: crossings and coverings, Discrete Math. 33 (1981) 67-77.
36. L.W. Shapiro, A Catalan triangle, Discrete Math. 14 (1976) 83-90.
37. L.W. Shapiro, A short proof of an identity of Touchard's concerning Catalan numbers, J. Combin. Theory Ser. A 20 (1976) 375-376.
38. L.W. Shapiro, Positive definite matrices and Catalan numbers, revisited, Proc. Amer. Math. Soc. 90 (3) (1984) 488-496.
39. R. Simion, D. Ullman, On the structure of the lattice of noncrossing partitions, Discrete Math. 98 (1991) 193-206.
40. D. Singmaster, An elementary evaluation of the Catalan numbers, Amer. Math. Monthly 85 (1978) 366-368.
41. N.J.A. Sloane, A Handbook of Integer Sequences, Academic Press, San Diego, 1973.
42. N.J.A. Sloane, S. Plouffe, The Encyclopedia of Integer Sequences, Academic Press, San Diego, 1995.
43. W.T. Tutte, A contribution to the theory of chromatic polynomials, Canad. J. Math. 6 (1954) 80-91.
44. W.T. Tutte, Chromials, in: C. Berge, D. Ray-Chaudhuri (Eds.), Hypergraph Seminar, Ohio State University, 1972, Lecture Notes in Mathematics, vol. 411, Springer, Berlin, 1974, pp. 243-266.
45. W.T. Tutte, On the Birkhoff-Lewis equations, Discrete Math. 92 (1991) 417-425.
46. W.T. Tutte, Chromials, in: D.R. Fulkerson (Ed.), Studies in Graph Theory, Part II, MAA Studies in Mathematics, vol. 12, The Mathematical Association of America, 1975, pp. 361-377.
47. H.S. Wilf, generatingfunctionology, 2nd ed., Academic Press, New York, 1994.