A new characterization of median graphs (Q1322201)

Given two vertices \(u\) and \(v\) of a graph, the interval \(l(u,v)\) is the set of vertices lying on some shortest path from \(u\) to \(v\). A graph is a median graph, if for any three vertices \(u\), \(v\) and \(w\), the intersection of the intervals \(l(u,v)\), \(l(u,w)\) and \(l(v,w)\) is a one- element set. A graph is Hilbertian if for any three vertices \(u\), \(v\) and \(w\), the interval \(l(u,v)\) contains the unique nearest vertex from \(w\). The author shows that a graph is median if and only if it is Hilbertian.