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
PB  - mathdoc
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  -