Median Graphs and Triangle-Free Graphs
From MaRDI portal
Recommendations
Cited in
(20)- Fast recognition algorithms for classes of partial cubes
- Computing median and antimedian sets in median graphs
- Two-ended regular median graphs
- Vertex-transitive median graphs of non-exponential growth
- Subquadratic-time algorithm for the diameter and all eccentricities on median graphs
- On the remoteness function in median graphs
- A charaterization of planar median graphs
- An ABC-problem for location and consensus functions on graphs
- Cube intersection concepts in median graphs
- Five axioms for location functions on median graphs
- Maximal proper subgraphs of median graphs
- Ramified rectilinear polygons: coordinatization by dendrons
- What do trees and hypercubes have in common?
- Tiled partial cubes
- Structure of Fibonacci cubes: a survey
- Competition hypergraphs of products of digraphs
- Planar median graphs and cubesquare-graphs
- Quasi-median graphs, their generalizations, and tree-like equalities
- On median graphs and median grid graphs
- On cube-free median graphs
This page was built for publication: Median Graphs and Triangle-Free Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4255811)