Similarity relations on finite ordered sets

DOI10.1016/0097-3165(77)90082-6MaRDI QIDQ1241759zbMATH OpenOpenAlexFDO

Authors Douglas G. Rogers

Publication date 1977

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(77)90082-6

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Total orders (06A05)

Cites work

• scientific article; zbMATH DE number 3448641 (Why is no real title available?)
• scientific article; zbMATH DE number 3199765 (Why is no real title available?)
• A Catalan triangle
• Extrapolation when very little is known about the source
• Motzkin numbers
• Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem

Cited in

(3)

• Catalan, Motzkin, and Riordan numbers
• Dyck path enumeration
• Pascal triangles, Catalan numbers and renewal arrays

This page was built for publication: Similarity relations on finite ordered sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1241759)