Geodesic
A characterization of geodetic graphs
Czechoslovak Mathematical Journal, Tome 45 (1995) no. 3, pp. 491-493
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

DOI : 10.21136/CMJ.1995.128536
Classification : 05C38, 05C75 
@article{10_21136_CMJ_1995_128536,
     author = {Nebesk\'y, Ladislav},
     title = {A characterization of geodetic graphs},
     journal = {Czechoslovak Mathematical Journal},
     pages = {491--493},
     year = {1995},
     volume = {45},
     number = {3},
     doi = {10.21136/CMJ.1995.128536},
     mrnumber = {1344515},
     zbl = {0841.05079},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1995.128536/}
}
TY  - JOUR
AU  - Nebeský, Ladislav
TI  - A characterization of geodetic graphs
JO  - Czechoslovak Mathematical Journal
PY  - 1995
SP  - 491
EP  - 493
VL  - 45
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1995.128536/
DO  - 10.21136/CMJ.1995.128536
LA  - en
ID  - 10_21136_CMJ_1995_128536
ER  - 
%0 Journal Article
%A Nebeský, Ladislav
%T A characterization of geodetic graphs
%J Czechoslovak Mathematical Journal
%D 1995
%P 491-493
%V 45
%N 3
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1995.128536/
%R 10.21136/CMJ.1995.128536
%G en
%F 10_21136_CMJ_1995_128536
Nebeský, Ladislav. A characterization of geodetic graphs. Czechoslovak Mathematical Journal, Tome 45 (1995) no. 3, pp. 491-493. doi: 10.21136/CMJ.1995.128536

[1] M. Behzad, G. Chartrand and L. Lesniak-Foster: Graphs & Digraphs. Prindle, Weber & Schmidt, Boston, 1979. | MR

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

Cité par Sources :