Previous |  Up |  Next

Article

References:
[1] H.-J. Bandelt, M. van de Vel and E. Verheul: Modular interval spaces. Math. Nachr. 163 (1993), 177–201. DOI 10.1002/mana.19931630117 | MR 1235066
[2] G. Chartrand and L. Lesniak: Graphs & Digraphs. Third edition. Chapman & Hall, London, 1996. MR 1408678
[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. Math. Bohem. 119 (1994), 15–20. MR 1303548
[5] L. Nebeský: A characterization of the interval function of a connected graph. Czechoslovak Math. J. 44 (119) (1994), 173–178. MR 1257943
[6] L. Nebeský: Geodesics and steps in a connected graph. Czechoslovak Math. J. 47 (122) (1997), 149–161. DOI 10.1023/A:1022404624515 | MR 1435613
[7] L. Nebeský: An axiomatic approach to metric properties of connected graphs. Czechoslovak Math. J. 50(125) (2000), 3–14. DOI 10.1023/A:1022472700080 | MR 1745453
[8] L. Nebeský: A new proof of a characterization of the set of all geodesics in a connected graph. Czechoslovak Math. J. 48(123) (1998), 809–813. DOI 10.1023/A:1022404126392 | MR 1658202
Partner of
EuDML logo