Characterizing almost-median graphs. II.
From MaRDI portal
Recommendations
Cites work
- A convexity lemma and expansion procedures for bipartite graphs
- Characterizing almost-median graphs
- Convex excess in partial cubes
- Fast recognition algorithms for classes of partial cubes
- Fast recognition of classes of almost-median graphs
- Graphs of acyclic cubical complexes
- Isometric subgraphs of Hamming graphs and d-convexity
- Netlike partial cubes II. Retracts and netlike subgraphs
- Netlike partial cubes. I. General properties
- Quasi-almostmedian graphs
- Recognizing partial cubes in quadratic time
- Tiled partial cubes
Cited in
(13)- Subquadratic-time algorithm for the diameter and all eccentricities on median graphs
- Fast recognition of classes of almost-median graphs
- Characterizing almost-median graphs
- Induced cycles in crossing graphs of median graphs
- Netlike partial cubes, V: completion and netlike classes
- Moore graphs and cycles are extremal graphs for convex cycles
- A new characterization of median graphs
- A characterization of regular partial cubes whose all convex cycles have the same lengths
- Graphs and finite distributive partial lattices
- First-order logic axiomatization of metric graph theory
- Tiled partial cubes
- Quasi-almostmedian graphs
- Regular pseudo-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)