%0 Journal Article
%A Nebeský, Ladislav
%T Visibilities and sets of shortest paths in a connected graph
%J Czechoslovak Mathematical Journal
%D 1995
%P 563-570
%V 45
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1995.128548/
%R 10.21136/CMJ.1995.128548
%G en
%F 10_21136_CMJ_1995_128548