Catalan, Motzkin, and Riordan numbers

1999/06/01 by Frank R. Bernhart · 68 citations
Engineering · Mathematics · #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Algorithm #Catalan number #Chromatic scale #Combinatorics #Discrete mathematics #Generating function #Integer sequence #Mathematics #Natural number #Recursion (computer science) #Sequence (biology) #graph theory and CDMA systems

paper · doi:10.1016/s0012-365x(99)00054-0

published in Discrete Mathematics 204(1-3), 73-112 (Elsevier BV)

crossref issued 1999/06/01 · crossref published 1999/06/01 · crossref published-print 1999/06/01 · openalex publication_date 1999/06/01 · crossref created 2003/04/23 · crossref deposited 2019/04/24 · openalex created_date 2025/10/10 · crossref indexed 2026/06/17 · openalex updated_date 2026/07/28

Citations

• Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
• An introduction to chromatic polynomials
• A Contribution to the Theory of Chromatic Polynomials
• The Reducibility of Maps
• Combinatorial Enumeration

Cited by

• A Uniform Approach Towards Succinct Representation of Trees
• A half-normal distribution scheme for generating functions
• Bell polynomials and k-generalized Dyck paths
• Enumeration on polyominoes determined by Catalan words avoiding (≥,≥)
• Motzkin number [wikipedia]