Visibilities and sets of shortest paths in a connected graph

@article{Nebeský1995,
author = {Nebeský, Ladislav},
journal = {Czechoslovak Mathematical Journal},
keywords = {shortest paths; visibility; connected graph},
language = {eng},
number = {3},
pages = {563-570},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Visibilities and sets of shortest paths in a connected graph},
url = {http://eudml.org/doc/31495},
volume = {45},
year = {1995},
}

TY - JOUR
AU - Nebeský, Ladislav
TI - Visibilities and sets of shortest paths in a connected graph
JO - Czechoslovak Mathematical Journal
PY - 1995
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 45
IS - 3
SP - 563
EP - 570
LA - eng
KW - shortest paths; visibility; connected graph
UR - http://eudml.org/doc/31495
ER -