Discrete Ordered Sets whose Covering Graphs are Median

DOI10.2307/2045257zbMath0547.06001OpenAlexW4234989699MaRDI QIDQ3338298

Hans-Jürgen Bandelt

Publication date: 1984

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

zbMATH Keywords

ordered setmedian graphsmedian semilatticescovering graph

Mathematics Subject Classification ID

Partial orders, general (06A06) Graph theory (05C99) Semilattices (06A12)

Related Items (8)

Medians for weight metrics in the covering graphs of semilattices ⋮ The median procedure on median graphs ⋮ Diagrams, orientations, and varieties ⋮ \(n\)-median semilattices ⋮ Lattice valuations, medians and majorities ⋮ Infinite median graphs, (0, 2)-graphs, and hypercubes ⋮ Medians in median graphs ⋮ From copair hypergraphs to median graphs with latent vertices

Cites Work

• Median graphs and Helly hypergraphs
• Median algebras
• Metric Ternary Distributive Semi-Lattices
• Graphs Orientable as Distributive Lattices
• Undirected Graphs Realizable as Graphs of Modular Lattices
• Medians, Lattices, and Trees

This page was built for publication: Discrete Ordered Sets whose Covering Graphs are Median