论文信息 - The set of geodesics in a graph

The set of geodesics in a graph

Abstract Nebeský [Math. Bohem. 119 (1994) 15] found a necessary and sufficient condition for a set of paths in a given connected graph G to be the set of all geodesics in G. A simple proof of an extension of that result will be outlined here.

Ladislav Nebeský

[1] Ladislav Nebeský. Route systems of a connected graph , 1994 .

[2] Eric R. Verheul,et al. Modular Interval Spaces , 1993 .

[3] Ladislav Nebeský. Characterizing the interval function of a connected graph , 1998 .

[4] Hans-Jürgen Bandelt,et al. A Helly theorem in weakly modular space , 1996, Discret. Math..

[5] Ladislav Nebeský,et al. A characterization of the interval function of a connected graph , 1994 .

[6] Ladislav Nebeský. A new proof of a characterization of the set of all geodesics in a connected graph , 1998 .

[7] Ladislav Nebeský. A characterization of the set of all shortest paths in a connected graph , 1994 .

[8] H. M. Mulder. The interval function of a graph , 1980 .