Skip to main content
Log in

Geodesics and steps in a connected graph

  • Published:
Czechoslovak Mathematical Journal Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. M. Behzad, G. Chartrand and L. Lesniak-Foster: Graphs & Digraphs. Prindle, Weber & Schmidt, Boston 1979.

    Google Scholar 

  2. F. Harary: Graph Theory. Addison-Wesley, Reading (Mass.) 1969.

    Google Scholar 

  3. D. C. Kay and G. Chartrand: A characterization of certain ptolemaic graphs. Canad. J. Math. 17 (1965), 342-346.

    Google Scholar 

  4. H. M. Mulder: The Interval Function of a Graph. Mathematisch Centrum. Amsterdam 1980.

    Google Scholar 

  5. L. Nebeský: A characterization of the set of all shortest paths in a connected graph. Mathematica Bohemica 119 (1994), 15-20.

    Google Scholar 

  6. L. Nebeský: A characterization of the interval function of a connected graph. Czechoslovak Math. J. 44(119) (1994), 173-178.

    Google Scholar 

  7. L. Nebeský: Visibilities and sets of shortest paths in a connected graph. Czechoslovak Math. J. 45(120) (1995), 563-570.

    Google Scholar 

  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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nebeský, L. Geodesics and steps in a connected graph. Czechoslovak Mathematical Journal 47, 149–161 (1997). https://doi.org/10.1023/A:1022404624515

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022404624515

Keywords

Navigation