References
M. Behzad, G. Chartrand, L. Lesniak-Foster: Graphs & Digraphs. Prindle, Weber & Schmidt, Boston, 1979.
F. Harary: Graph Theory. Addison-Wesley, Reading (Mass.), 1969.
H. M. Mulder: The Interval Function of a Graph. Mathematisch Centrum. Amsterdam, 1980.
L. Nebeský: A characterization of the set of all shortest paths in a connected graph. Math. Bohem. 119 (1994), 15–20.
L. Nebeský: A characterization of the interval function of a connected graph. Czechoslovak Math. J. 44(119) (1994), 173–178.
L. Nebeský: Visibilities and sets of shortest paths in a connected graph. Czechoslovak Math. J. 45(120) (1995), 563–570.
L. Nebeský: On the set of all shortest paths of a given length in a connected graph. Czechoslovak Math. J. 46(121) (1996), 155–160.
L. Nebeský: Geodesics and steps in a connected graph. Czechoslovak Math. J. 47(122) (1997), 149–161.
L. Nebeský: An algebraic characterization of geodetic graphs. Czechoslovak Math. J. 48(123) (1998), 701–710.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Nebeský, L. An axiomatic approach to metric properties of connected graphs. Czechoslovak Mathematical Journal 50, 3–14 (2000). https://doi.org/10.1023/A:1022472700080
Issue Date:
DOI: https://doi.org/10.1023/A:1022472700080