Characterizing almost-median graphs
From MaRDI portal
Publication:872051
DOI10.1016/J.EJC.2005.10.009zbMATH Open1113.05029OpenAlexW2069879629MaRDI QIDQ872051FDOQ872051
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Isometric embedding in products of complete graphs
- Distance-preserving subgraphs of hypercubes
- Title not available (Why is that?)
- Quasi‐median graphs and algebras
- Quasi-median graphs, their generalizations, and tree-like equalities
- A convexity lemma and expansion procedures for bipartite graphs
- Fast recognition algorithms for classes of partial cubes
- Tiled partial cubes
- Fast recognition of classes of almost-median graphs
- Partial Hamming graphs and expansion procedures
Cited In (11)
- Pseudo-median graphs: Decomposition via amalgamation and Cartesian multiplication
- Subquadratic-time algorithm for the diameter and all eccentricities on median graphs
- Almost self-centered median and chordal graphs
- First-order logic axiomatization of metric graph theory
- Asymptotic number of isometric generalized Fibonacci cubes
- A characterization of regular partial cubes whose all convex cycles have the same lengths
- Recognizing median graphs in subquadratic time
- A new characterization of median graphs
- Characterizing almost-median graphs. II.
- Fast recognition of classes of almost-median graphs
- Recognizing pseudo-median graphs
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)
