An axiomatic approach to metric properties of connected graphs
Czechoslovak Mathematical Journal (2000)
- Volume: 50, Issue: 1, page 3-14
- ISSN: 0011-4642
Access Full Article
topHow to cite
topReferences
top- Graphs & Digraphs, Prindle, Weber & Schmidt, Boston, 1979. (1979) MR0525578
- Graph Theory, Addison-Wesley, Reading (Mass.), 1969. (1969) Zbl0196.27202MR0256911
- The Interval Function of a Graph, Mathematisch Centrum. Amsterdam, 1980. (1980) Zbl0446.05039MR0605838
- A characterization of the set of all shortest paths in a connected graph, Math. Bohem. 119 (1994), 15–20. (1994) MR1303548
- A characterization of the interval function of a connected graph, Czechoslovak Math. J. 44 (119) (1994), 173–178. (1994) MR1257943
- Visibilities and sets of shortest paths in a connected graph, Czechoslovak Math. J. 45 (120) (1995), 563–570. (1995) MR1344521
- On the set of all shortest paths of a given length in a connected graph, Czechoslovak Math. J. 46 (121) (1996), 155–160. (1996) MR1371697
- 10.1023/A:1022404624515, Czechoslovak Math. J. 47 (122) (1997), 149–161. (1997) MR1435613DOI10.1023/A:1022404624515
- 10.1023/A:1022435605919, Czechoslovak Math. J. 48 (123) (1998), 701–710. (1998) MR1658245DOI10.1023/A:1022435605919