Geodesic
Visibilities and sets of shortest paths in a connected graph
Czechoslovak Mathematical Journal, Tome 45 (1995) no. 3, pp. 563-570
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

DOI : 10.21136/CMJ.1995.128548
Classification : 05C12, 05C38 
@article{10_21136_CMJ_1995_128548,
     author = {Nebesk\'y, Ladislav},
     title = {Visibilities and sets of shortest paths in a connected graph},
     journal = {Czechoslovak Mathematical Journal},
     pages = {563--570},
     year = {1995},
     volume = {45},
     number = {3},
     doi = {10.21136/CMJ.1995.128548},
     mrnumber = {1344521},
     zbl = {0856.05059},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1995.128548/}
}
TY  - JOUR
AU  - Nebeský, Ladislav
TI  - Visibilities and sets of shortest paths in a connected graph
JO  - Czechoslovak Mathematical Journal
PY  - 1995
SP  - 563
EP  - 570
VL  - 45
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1995.128548/
DO  - 10.21136/CMJ.1995.128548
LA  - en
ID  - 10_21136_CMJ_1995_128548
ER  - 
%0 Journal Article
%A Nebeský, Ladislav
%T Visibilities and sets of shortest paths in a connected graph
%J Czechoslovak Mathematical Journal
%D 1995
%P 563-570
%V 45
%N 3
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1995.128548/
%R 10.21136/CMJ.1995.128548
%G en
%F 10_21136_CMJ_1995_128548
Nebeský, Ladislav. Visibilities and sets of shortest paths in a connected graph. Czechoslovak Mathematical Journal, Tome 45 (1995) no. 3, pp. 563-570. doi: 10.21136/CMJ.1995.128548

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

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

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

Cité par Sources :