Geodesic
On the set of all shortest paths of a given length in a connected graph
Czechoslovak Mathematical Journal, Tome 46 (1996) no. 1, pp. 155-160
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

DOI : 10.21136/CMJ.1996.127279
Classification : 05C38 
@article{10_21136_CMJ_1996_127279,
     author = {Nebesk\'y, Ladislav},
     title = {On the set of all shortest paths of a given length in a connected graph},
     journal = {Czechoslovak Mathematical Journal},
     pages = {155--160},
     year = {1996},
     volume = {46},
     number = {1},
     doi = {10.21136/CMJ.1996.127279},
     mrnumber = {1371697},
     zbl = {0902.05042},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1996.127279/}
}
TY  - JOUR
AU  - Nebeský, Ladislav
TI  - On the set of all shortest paths of a given length in a connected graph
JO  - Czechoslovak Mathematical Journal
PY  - 1996
SP  - 155
EP  - 160
VL  - 46
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1996.127279/
DO  - 10.21136/CMJ.1996.127279
LA  - en
ID  - 10_21136_CMJ_1996_127279
ER  - 
%0 Journal Article
%A Nebeský, Ladislav
%T On the set of all shortest paths of a given length in a connected graph
%J Czechoslovak Mathematical Journal
%D 1996
%P 155-160
%V 46
%N 1
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1996.127279/
%R 10.21136/CMJ.1996.127279
%G en
%F 10_21136_CMJ_1996_127279
Nebeský, Ladislav. On the set of all shortest paths of a given length in a connected graph. Czechoslovak Mathematical Journal, Tome 46 (1996) no. 1, pp. 155-160. doi: 10.21136/CMJ.1996.127279

[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. Math. Bohemica 119 (1994), 15–20. | MR

[3] L. Nebeský: Visibilities and sets of shortest paths in a connected graph. Czechoslovak Math. Journal 45(120) (1995), 563–570. | MR

Cité par Sources :