Characterizing almost-median graphs

DOI10.1016/J.EJC.2005.10.009MaRDI QIDQ872051zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Characterizing almost-median graphs. II.
• Quasi-almostmedian graphs
• Median and quasi-median direct products of graphs
• scientific article; zbMATH DE number 1339499
• Almost self-centered median and chordal graphs

Cites work

• scientific article; zbMATH DE number 3697163 (Why is no real title available?)
• scientific article; zbMATH DE number 1339499 (Why is no real title available?)
• scientific article; zbMATH DE number 1550912 (Why is no real title available?)
• A convexity lemma and expansion procedures for bipartite graphs
• Distance-preserving subgraphs of hypercubes
• Fast recognition algorithms for classes of partial cubes
• Fast recognition of classes of almost-median graphs
• Isometric embedding in products of complete graphs
• Partial Hamming graphs and expansion procedures
• Quasi-median graphs, their generalizations, and tree-like equalities
• Quasi‐median graphs and algebras
• Tiled partial cubes

Cited in

(13)

• The algebra of metric betweenness. II: Geometry and equational characterization of weakly median graphs
• Subquadratic-time algorithm for the diameter and all eccentricities on median graphs
• Recognizing pseudo-median graphs
• Fast recognition of classes of almost-median graphs
• Asymptotic number of isometric generalized Fibonacci cubes
• Almost self-centered median and chordal graphs
• A new characterization of median graphs
• A characterization of regular partial cubes whose all convex cycles have the same lengths
• First-order logic axiomatization of metric graph theory
• Characterizing almost-median graphs. II.
• Recognizing median graphs in subquadratic time
• Quasi-almostmedian graphs
• Pseudo-median graphs: Decomposition via amalgamation and Cartesian multiplication

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

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