| Title:
|
Visibilities and sets of shortest paths in a connected graph (English) |
| Author:
|
Nebeský, Ladislav |
| Language:
|
English |
| Journal:
|
Czechoslovak Mathematical Journal |
| ISSN:
|
0011-4642 (print) |
| ISSN:
|
1572-9141 (online) |
| Volume:
|
45 |
| Issue:
|
3 |
| Year:
|
1995 |
| Pages:
|
563-570 |
| . |
| Category:
|
math |
| . |
| MSC:
|
05C12 |
| MSC:
|
05C38 |
| idZBL:
|
Zbl 0856.05059 |
| idMR:
|
MR1344521 |
| DOI:
|
10.21136/CMJ.1995.128548 |
| . |
| Date available:
|
2009-09-24T09:50:40Z |
| Last updated:
|
2020-07-29 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/128548 |
| . |
| Reference:
|
[1] H.M. Mulder: The Interval Function of a Graph.Mathematisch Centrum, Amsterdam, 1980. Zbl 0446.05039, MR 0605838 |
| Reference:
|
[2] L. Nebeský: A characterization of the set of all shortest paths in a connected graph.Mathematica Bohemica 119 (1994), 15–20. MR 1303548 |
| Reference:
|
[3] L. Nebeský: A characterization of the interval function of a connected graph.Czechoslovak Math. Journal 44(119) (1994), 173–178. MR 1257943 |
| . |
