| Title:
|
A characterization of the set of all shortest paths in a connected graph
(English)
|
| Author:
|
Nebeský, Ladislav |
| Language:
|
English |
| Journal:
|
Mathematica Bohemica |
| ISSN:
|
0862-7959 |
| Volume:
|
119 |
| Issue:
|
1 |
| Year:
|
1994 |
| Pages:
|
15-20 |
| . |
| Category:
|
math |
| . |
| Summary:
|
|
| MSC:
|
05C12 |
| MSC:
|
05C38 |
| MSC:
|
05C75 |
| idZBL:
|
Zbl 0807.05045 |
| idMR:
|
MR1303548 |
| . |
| Date available:
|
2009-09-24T21:02:18Z |
| Last updated:
|
2012-06-18 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/126208 |
| . |
| Reference:
|
[1] M. Behzad G. Chartrand, L. Lesniak-Foster: Graphs & Digraphs.Prindle, Weber & Schmidt, Boston, 1979. MR 0525578 |
| Reference:
|
[2] D.C. Kay, G. Chartrand: A characterization of certain ptolemaic graphs.Canad. J. Math. 17 (1965), 342-346. Zbl 0139.17301, MR 0175113 |
| Reference:
|
[3] H.M. Mulder: The Interval Function of a Graph.Mathematisch Centrum, Amsterdam, 1980. Zbl 0446.05039, MR 0605838 |
| Reference:
|
[4] L. Nebeský: Route systems and bipartite graphs.Czechoslovak Math. Journal 41 (116) (1991), 260-264. MR 1105440 |
| . |
