[1] P. V. Ceccherini: Studying structures by counting geodesics. In: Combinatorial Designs and Applications, W. D. Wallis et al. (eds.), Marcel Dekker, New York and Basel, 1990, pp. 15–32. MR 1088485 | Zbl 0741.05041

[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ý: On the set of all shortest paths of a given length in a connected graph. Czechoslovak Math. Journal 46 (121) (1996), 155–160. MR 1371697

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