Graphs Orientable as Distributive Lattices

DOI10.2307/2044697MaRDI QIDQ3658039zbMATH OpenOpenAlexWikidataFDO

Authors Dwight Duffus, Ivan Rival

Publication date 1983

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

zbMATH Keywords

covering graphdiameterfinite distributive latticefinite partially ordered sethypercuberetract

Mathematics Subject Classification ID

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

Cites work

• A Characterization of Comparability Graphs and of Interval Graphs
• scientific article; zbMATH DE number 3172312 (Why is no real title available?)
• scientific article; zbMATH DE number 3430713 (Why is no real title available?)
• scientific article; zbMATH DE number 3094303 (Why is no real title available?)
• Maximal Sublattices of Finite Distributive Lattices. II
• Path length in the covering graph of a lattice
• Undirected Graphs Realizable as Graphs of Modular Lattices

Cited in

(16)

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

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

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