%0 Journal Article
%A Nebeský, Ladislav
%T A characterization of the set of all shortest paths in a connected graph
%J Mathematica Bohemica
%D 1994
%P 15-20
%V 119
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.21136/MB.1994.126208/
%R 10.21136/MB.1994.126208
%G en
%F 10_21136_MB_1994_126208