On the set of all shortest paths of a given length in a connected graph
Czechoslovak Mathematical Journal (1996)
- Volume: 46, Issue: 1, page 155-160
- ISSN: 0011-4642
Access Full Article
top
How to cite
topNebeský, Ladislav. "On the set of all shortest paths of a given length in a connected graph." Czechoslovak Mathematical Journal 46.1 (1996): 155-160. <http://eudml.org/doc/30297>.
@article{Nebeský1996,
author = {Nebeský, Ladislav},
journal = {Czechoslovak Mathematical Journal},
keywords = {shortest path; connected graph; characterization},
language = {eng},
number = {1},
pages = {155-160},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {On the set of all shortest paths of a given length in a connected graph},
url = {http://eudml.org/doc/30297},
volume = {46},
year = {1996},
}
TY - JOUR
AU - Nebeský, Ladislav
TI - On the set of all shortest paths of a given length in a connected graph
JO - Czechoslovak Mathematical Journal
PY - 1996
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 46
IS - 1
SP - 155
EP - 160
LA - eng
KW - shortest path; connected graph; characterization
UR - http://eudml.org/doc/30297
ER -
References
top- Graphs & Digraphs, Prindle, Weber & Schmidt, Boston, 1979. (1979) MR0525578
- A characterization of the set of all shortest paths in a connected graph, Math. Bohemica 119 (1994), 15–20. (1994) MR1303548
- Visibilities and sets of shortest paths in a connected graph, Czechoslovak Math. Journal 45(120) (1995), 563–570. (1995) MR1344521
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.