[1] M. Behzad, G. Chartrand, L. Lesniak-Foster: Graphs & Digraphs. Prindle, Weber & Schmidt, Boston, 1979. MR 0525578

[2] F. Harary: Graph Theory. Addison-Wesley, Reading (Mass.), 1969. MR 0256911 | Zbl 0196.27202

[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 paths in a connected graph. Math. Bohem. 119 (1994), 15–20. MR 1303548

[5] L. Nebeský: A characterization of the interval function of a connected graph. Czechoslovak Math. J. 44 (119) (1994), 173–178. MR 1257943

[6] L. Nebeský: Visibilities and sets of shortest paths in a connected graph. Czechoslovak Math. J. 45 (120) (1995), 563–570. MR 1344521

[7] L. Nebeský: On the set of all shortest paths of a given length in a connected graph. Czechoslovak Math. J. 46 (121) (1996), 155–160. MR 1371697

[8] L. Nebeský: Geodesics and steps in a connected graph. Czechoslovak Math. J. 47 (122) (1997), 149–161. DOI 10.1023/A:1022404624515 | MR 1435613

[9] L. Nebeský: An algebraic characterization of geodetic graphs. Czechoslovak Math. J. 48 (123) (1998), 701–710. DOI 10.1023/A:1022435605919 | MR 1658245