Characterizing almost-median graphs

DOI10.1016/j.ejc.2005.10.009zbMath1113.05029OpenAlexW2069879629MaRDI QIDQ872051

Boštjan Brešar

Publication date: 27 March 2007

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2005.10.009

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

Related Items (4)

Subquadratic-time algorithm for the diameter and all eccentricities on median graphs ⋮ First-order logic axiomatization of metric graph theory ⋮ Asymptotic number of isometric generalized Fibonacci cubes ⋮ Characterizing almost-median graphs. II.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Isometric embedding in products of complete graphs
• Fast recognition of classes of almost-median graphs
• A convexity lemma and expansion procedures for bipartite graphs
• Quasi-median graphs, their generalizations, and tree-like equalities
• Fast recognition algorithms for classes of partial cubes
• Distance-preserving subgraphs of hypercubes
• Quasi‐median graphs and algebras
• Tiled partial cubes
• Partial Hamming graphs and expansion procedures

This page was built for publication: Characterizing almost-median graphs