[1] M. Behzad, G. Chartrand and L. Lesniak-Forster:
Graphs & Digraphs. Prindle, Weber & Schmidt, Boston, 1979.
MR 0525578
[2] D. C. Kay and G. Chartrand:
A characterization of certain ptolemaic graphs. Canad. J. Math. 17 (1965), 342–346.
MR 0175113
[4] L. Nebeský:
A characterization of the set of all shortest path in a connected graph. Math. Boh. 119 (1994), 15–20.
MR 1303548