[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. DOI 10.4153/CJM-1965-034-0 | MR 0175113

[3] H. M. Mulder: The Interval Function of a Graph. Mathematisch Centrum, Amsterdam, 1980. MR 0605838 | Zbl 0446.05039

[4] L. Nebeský: A characterization of the set of all shortest path in a connected graph. Math. Boh. 119 (1994), 15–20. MR 1303548