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

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

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