About DML-CZ | FAQ | Conditions of Use | Math Archives | Contact Us
  Previous |  Up |  Next

Article

First Page Preview
Nebeský, Ladislav
Geodesics and steps in a connected graph. (English). Czechoslovak Mathematical Journal, vol. 47 (1997), issue 1, pp. 149-161
MSC: 05C12, 05C38 | MR 1435613 | Zbl 0898.05041
References:
[1] M. Behzad, G. Chartrand and L. Lesniak-Foster: Graphs & Digraphs. Prindle, Weber & Schmidt, Boston 1979. MR 0525578
[2] F. Harary: Graph Theory. Addison-Wesley, Reading (Mass.) 1969. MR 0256911 | Zbl 1161.05345
[3] D. C. Kay and G. Chartrand: A characterization of certain ptolemaic graphs. Canad. J. Math. 17 (1965), 342–346. DOI 10.4153/CJM-1965-034-0 | MR 0175113
[4] H. M. Mulder: The Interval Function of a Graph. Mathematisch Centrum. Amsterdam 1980. MR 0605838
[5] L. Nebeský: A characterization of the set of all shortest paths in a connected graph. Mathematica Bohemica 119 (1994), 15–20. MR 1303548
[6] L. Nebeský: A characterization of the interval function of a connected graph. Czechoslovak Math. J. 44 (119) (1994), 173–178. MR 1257943
[7] L. Nebeský: Visibilities and sets of shortest paths in a connected graph. Czechoslovak Math. J. 45(120) (1995), 563–570. MR 1344521
[8] L. Nebeský: On the set of all shortest paths of a given length in a connected graph. Czechoslovak Math. J. 46(121) (1996), 155–160. MR 1371697
Partner of
EuDML logo