Characterizing almost-median graphs. II.

DOI10.1016/J.DISC.2011.09.008zbMATH Open1233.05096OpenAlexW1994171870MaRDI QIDQ658076FDOQ658076

S. Shpectorov, Sandi Klavžar

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

Recommendations

• Characterizing almost-median graphs
• Quasi-almostmedian graphs
• Partial cubes and their \(\tau\)-graphs
• Netlike partial cubes III. The median cycle property
• Netlike partial cubes. I. General properties

zbMATH Keywords

partial cubemedian graphalmost-median graphconvex cycle

Mathematics Subject Classification ID

Distance in graphs (05C12)

Cites Work

• Netlike partial cubes. I. General properties
• Convex excess in partial cubes
• Graphs of acyclic cubical complexes
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Tiled partial cubes
• Isometric subgraphs of Hamming graphs and d-convexity
• Fast recognition of classes of almost-median graphs
• Characterizing almost-median graphs

Cited In (8)

• Subquadratic-time algorithm for the diameter and all eccentricities on median graphs
• Moore Graphs and Cycles Are Extremal Graphs for Convex Cycles
• Graphs and finite distributive partial lattices
• First-order logic axiomatization of metric graph theory
• A characterization of regular partial cubes whose all convex cycles have the same lengths
• Tiled partial cubes
• Regular pseudo-median graphs
• A new characterization of median graphs

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

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