Characterizing almost-median graphs. II.

DOI10.1016/j.disc.2011.09.008zbMath1233.05096OpenAlexW1994171870MaRDI QIDQ658076

Sandi Klavžar, Sergey V. Shpectorov

Publication date: 11 January 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.09.008

zbMATH Keywords

partial cubemedian graphalmost-median graphconvex cycle

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (3)

Moore Graphs and Cycles Are Extremal Graphs for Convex Cycles ⋮ Subquadratic-time algorithm for the diameter and all eccentricities on median graphs ⋮ First-order logic axiomatization of metric graph theory

Cites Work

• Fast recognition of classes of almost-median graphs
• Characterizing almost-median graphs
• Netlike partial cubes II. Retracts and netlike subgraphs
• A convexity lemma and expansion procedures for bipartite graphs
• Fast recognition algorithms for classes of partial cubes
• Graphs of acyclic cubical complexes
• Netlike partial cubes. I. General properties
• Convex excess in partial cubes
• Tiled partial cubes
• Isometric subgraphs of Hamming graphs and d-convexity
• Unnamed Item
• Unnamed Item

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