Graphs Orientable as Distributive Lattices

DOI10.2307/2044697zbMath0513.06004OpenAlexW4248274070WikidataQ60962150 ScholiaQ60962150MaRDI QIDQ3658039

Dwight Duffus, Ivan Rival

Publication date: 1983

Full work available at URL: https://doi.org/10.2307/2044697

zbMATH Keywords

hypercubediameterfinite distributive latticeretractcovering graphfinite partially ordered set

Mathematics Subject Classification ID

Partial orders, general (06A06) Structure and representation theory of distributive lattices (06D05) Directed graphs (digraphs), tournaments (05C20)

Related Items (16)

Distributive lattice structure on the set of perfect matchings of carbon nanotubes ⋮ Discrete Ordered Sets whose Covering Graphs are Median ⋮ Clique-gated graphs ⋮ Inversions, cuts, and orientations ⋮ Resonance graphs on perfect matchings of graphs on surfaces ⋮ A structure theory for ordered sets ⋮ Diagrams, orientations, and varieties ⋮ Retract rigid Cartesian products of graphs ⋮ Non-matchable distributive lattices ⋮ Counting vertices and cubes in median graphs of circular split systems ⋮ A dynamic location problem for graphs ⋮ Absolute retracts of bipartite graphs ⋮ Obituary: Ivan Rival ⋮ Recognizing median graphs in subquadratic time ⋮ On graphs that can be oriented as diagrams of ordered sets ⋮ Efficient polynomial algorithms for distributive lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Path length in the covering graph of a lattice
• Undirected Graphs Realizable as Graphs of Modular Lattices
• Maximal Sublattices of Finite Distributive Lattices. II
• A Characterization of Comparability Graphs and of Interval Graphs

This page was built for publication: Graphs Orientable as Distributive Lattices