Full entry |
PDF
(0.2 MB)
Feedback

References:

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

[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**. Mathematica Bohemica 119 (1994), 15–20. MR 1303548

[5] L. Nebeský: **A characterization of geodetic graphs**. Czechoslovak Math. Journal 45 (120) (1995), 491–493. MR 1344515

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