THE ENUMERATION OF A FAMILY OF LADDER GRAPHS PART II: SCHRODER AND SUPERCONNECTIVE RELATIONS

DOI10.1093/qmath/31.4.491zbMath0451.05034OpenAlexW2058939513MaRDI QIDQ3897075

Douglas G. Rogers

Publication date: 1980

Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/qmath/31.4.491

zbMATH Keywords

ladder graphconnective relationleft Shroder relationSchroder numbersuperconnective relation

Mathematics Subject Classification ID

Hypergraphs (05C65) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15)

Related Items

Extremal problems for ordered hypergraphs: small patterns and some enumeration ⋮ The Narayana distribution ⋮ Eplett's identity for renewal arrays ⋮ Deux propriétés combinatoires des nombres de Schröder ⋮ Catalan, Motzkin, and Riordan numbers ⋮ Analytic combinatorics of non-crossing configurations