Rhyming schemes: crossings and coverings

DOI10.1016/0012-365X(81)90259-4zbMath0451.05022MaRDI QIDQ1147712

Douglas G. Rogers

Publication date: 1981

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

generating functionsplanarenumeratinglines of a poem as points of a graphrhyme

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (4)

Enumerating a class of lattice paths ⋮ Heisenberg characters, unitriangular groups, and Fibonacci numbers ⋮ Identities involving Narayana polynomials and Catalan numbers ⋮ Catalan, Motzkin, and Riordan numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumeration of plane trees by branches and endpoints
• A Catalan triangle
• Erratum to ``Similarity relations on finite ordered sets
• Enumeration of ladder graphs
• The Distribution of Crossings of Chords Joining Pairs of 2n Points on a Circle
• THE ENUMERATION OF A FAMILY OF LADDER GRAPHS
• Extrapolation when very little is known about the source
• Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem
• Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
• Motzkin numbers
• Structure inherent in a free groupoid

This page was built for publication: Rhyming schemes: crossings and coverings