Visibilities and sets of shortest paths in a connected graph

Previous | Up | Next

Article

Visibilities and sets of shortest paths in a connected graph. (English). Czechoslovak Mathematical Journal, vol. 45 (1995), issue 3, pp. 563-570

MSC: 05C12, 05C38 | MR 1344521 | Zbl 0856.05059 | DOI: 10.21136/CMJ.1995.128548

References:

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

[2] L. Nebeský: A characterization of the set of all shortest paths in a connected graph. Mathematica Bohemica 119 (1994), 15–20. MR 1303548

[3] L. Nebeský: A characterization of the interval function of a connected graph. Czechoslovak Math. Journal 44(119) (1994), 173–178. MR 1257943

Partner of