| Title:
|
On the set of all shortest paths of a given length in a connected graph (English) |
| Author:
|
Nebeský, Ladislav |
| Language:
|
English |
| Journal:
|
Czechoslovak Mathematical Journal |
| ISSN:
|
0011-4642 (print) |
| ISSN:
|
1572-9141 (online) |
| Volume:
|
46 |
| Issue:
|
1 |
| Year:
|
1996 |
| Pages:
|
155-160 |
| . |
| Category:
|
math |
| . |
| MSC:
|
05C38 |
| idZBL:
|
Zbl 0902.05042 |
| idMR:
|
MR1371697 |
| DOI:
|
10.21136/CMJ.1996.127279 |
| . |
| Date available:
|
2009-09-24T09:55:02Z |
| Last updated:
|
2020-07-29 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/127279 |
| . |
| Reference:
|
[1] M. Behzad, G. Chartrand and L. Lesniak-Foster: Graphs & Digraphs.Prindle, Weber & Schmidt, Boston, 1979. MR 0525578 |
| Reference:
|
[2] L. Nebeský: A characterization of the set of all shortest paths in a connected graph.Math. Bohemica 119 (1994), 15–20. MR 1303548 |
| Reference:
|
[3] L. Nebeský: Visibilities and sets of shortest paths in a connected graph.Czechoslovak Math. Journal 45(120) (1995), 563–570. MR 1344521 |
| . |
