%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
%I mathdoc
%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