[2] G. Chartrand and L. Lesniak:
Graphs & Digraphs. Third edition. Chapman & Hall, London, 1996.
MR 1408678
[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
[8] L. Nebeský:
A new proof of a characterization of the set of all geodesics in a connected graph. Czechoslovak Math. J. 48(123) (1998), 809–813.
DOI 10.1023/A:1022404126392 |
MR 1658202