Diagrams, orientations, and varieties

DOI10.1007/BF02034330zbMath0697.06003OpenAlexW2054401224MaRDI QIDQ911621

Ivan Rival, Hans-Jürgen Bandelt

Publication date: 1989

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02034330

zbMATH Keywords

productinversionorientationsretractcovering graphAlternating cover-cyclesclassifications of posetsdiagram for a posetreorientation varietiesretract-product variety

Mathematics Subject Classification ID

Partial orders, general (06A06) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20) Varieties of lattices (06B20)

Related Items (2)

Inversions, cuts, and orientations ⋮ Obituary: Ivan Rival

Cites Work

• Unnamed Item
• Unnamed Item
• Antichain cutsets
• On graphs that can be oriented as diagrams of ordered sets
• On reorienting graphs by pushing down maximal vertices
• Is there a diagram invariant?
• A structure theory for ordered sets
• Complexity of diagrams
• Discrete Ordered Sets whose Covering Graphs are Median
• Retracts of hypercubes
• Graphs Orientable as Distributive Lattices
• A Theorem on n-Coloring the Points of a Linear Graph
• A theorem on three-coloring the edges of a trivalent graph

This page was built for publication: Diagrams, orientations, and varieties