A characterization of the set of all shortest paths in a connected graph

Previous | Up | Next

Article

A characterization of the set of all shortest paths in a connected graph. (English). Mathematica Bohemica, vol. 119 (1994), issue 1, pp. 15-20

MSC: 05C12, 05C38, 05C75 | MR 1303548 | Zbl 0807.05045

References:

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

[2] D.C. Kay, G. Chartrand: A characterization of certain ptolemaic graphs. Canad. J. Math. 17 (1965), 342-346. MR 0175113 | Zbl 0139.17301

[3] H.M. Mulder: The Interval Function of a Graph. Mathematisch Centrum, Amsterdam, 1980. MR 0605838 | Zbl 0446.05039

[4] L. Nebeský: Route systems and bipartite graphs. Czechoslovak Math. Journal 41 (116) (1991), 260-264. MR 1105440

Partner of