Visibilities and sets of shortest paths in a connected graph
Czechoslovak Mathematical Journal (1995)
- Volume: 45, Issue: 3, page 563-570
- ISSN: 0011-4642
Access Full Article
top
How to cite
topNebeský, Ladislav. "Visibilities and sets of shortest paths in a connected graph." Czechoslovak Mathematical Journal 45.3 (1995): 563-570. <http://eudml.org/doc/31495>.
@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 -
References
top- The Interval Function of a Graph, Mathematisch Centrum, Amsterdam, 1980. (1980) Zbl0446.05039MR0605838
- A characterization of the set of all shortest paths in a connected graph, Mathematica Bohemica 119 (1994), 15–20. (1994) MR1303548
- A characterization of the interval function of a connected graph, Czechoslovak Math. Journal 44(119) (1994), 173–178. (1994) MR1257943
Citations in EuDML Documents
topNotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.