Infinite median graphs, (0, 2)-graphs, and hypercubes

DOI10.1002/jgt.3190070415zbMath0525.05055OpenAlexW1994041466MaRDI QIDQ3039399

Hans-Jürgen Bandelt, Henry Martyn Mulder

Publication date: 1983

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190070415

zbMATH Keywords

hypercubeshortest pathbipartite graphsmedian graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph theory (05C99)

Related Items (14)

There are no finite partial cubes of girth more than 6 and minimum degree at least 3 ⋮ Clique-gated graphs ⋮ Cartesian products of block graphs ⋮ First-order logic axiomatization of metric graph theory ⋮ Regular median graphs of linear growth ⋮ Vertex-transitive median graphs of non-exponential growth ⋮ Lattice valuations, medians and majorities ⋮ Distance monotone graphs and a new characterization of hypercubes ⋮ Two-ended regular median graphs ⋮ Yang-Baxter equation in median algebras ⋮ A dynamic location problem for graphs ⋮ On \(F\)-geodetic graphs ⋮ Recognizing median graphs in subquadratic time ⋮ Transitive, locally finite median graphs with finite blocks

Cites Work

• Discrete Ordered Sets whose Covering Graphs are Median
• Unnamed Item

This page was built for publication: Infinite median graphs, (0, 2)-graphs, and hypercubes