A characterization of geodetic graphs

Previous | Up | Next

Article

A characterization of geodetic graphs. (English). Czechoslovak Mathematical Journal, vol. 45 (1995), issue 3, pp. 491-493

MSC: 05C38, 05C75 | MR 1344515 | Zbl 0841.05079 | DOI: 10.21136/CMJ.1995.128536

References:

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

Partner of