scientific article; zbMATH DE number 3889587

MaRDI QIDQ3222890zbMATH OpenFDO

Authors Ivan Rival

Publication date 1985

zbMATH Keywords

comparability graphscovering graphsdiagramsordered sets

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (05C99) Partial orders, general (06A06)

Recommendations

• scientific article; zbMATH DE number 3914376
• Order, genus, and diagram invariance
• scientific article; zbMATH DE number 4195994
• Orders with level diagrams
• scientific article; zbMATH DE number 432740

Cited in

(17)

• Strict refinement for graphs and digraphs
• Characterization of diagrams by 0-1 inequalities
• A non-covering graph of girth six
• Lattices contained in planar orders are planar
• A note on optimal area algorithms for upward drawings of binary trees
• Products of abstract polytopes
• M-chain graphs of posets
• Obituary: Ivan Rival
• The complexity of cover graph recognition for some varieties of finite lattices
• Stability of regional orthomodular posets under synchronisation and refinement
• Inversions, cuts, and orientations
• Orders with level diagrams
• The higher Cichoń diagram
• Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
• Enumerating orientations of ordered sets
• Diagrams and torsors
• Non-cover generalized Mycielski, Kneser, and Schrijver graphs

This page was built for publication:

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