Skip to main content

Short Disjoint Paths in Locally Connected Graphs

Graphs and Combinatorics volume 23, pages 509–519 (2007)Cite this article

Abstract

Chartrand and Pippert proved that a connected, locally k-connected graph is (k + 1)-connected. We investigate the lengths of k + 1 disjoint paths between two vertices in locally k-connected graphs with respect to several graph parameters, e.g. the k-diameter of a graph. We also give a generalization of the mentioned result.

This is a preview of subscription content, access via your institution.

Access options

Buy single article

Instant access to the full article PDF.

USD 39.95

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

References

  1. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications, Macmillan, London, 1976

  2. Chartrand, G., Pippert, R.E.: Locally connected graphs, Časopis pro pěstování matematiky, 99, 158–163 (1974)

  3. Frank, A.: Connectivity and network flows. In: Handbook of Combinatorics (R.L. Graham et al. eds.), Elsevier, Amsterdam, 1995, pp. 111–177

  4. Lovász, L., Neumann-Lara, V., Plummer, M.D.: Mengerian theorems for paths of bounded length, Period Math. Hungar. 9, 269–276 (1978)

    Google Scholar 

  5. Menger, K.: Zur allgemeinen Kurventheorie, Fund. Math. 10, 96–115 (1927)

    Google Scholar 

Download references

Author information

Affiliations

  1. Institute of Systems Science, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, 100080, P.R. China

    Chuanping Chen

  2. Department of Mathematics, University of West Bohemia, Univerzitní 8, 306 14, Plzeň, Czech Republic

    Roman Čada, Tomáš Kaiser & Zdeněk Ryjáček

Authors
  1. Chuanping Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roman Čada
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tomáš Kaiser
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Zdeněk Ryjáček
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Roman Čada.

Additional information

This research was partly done on a visit to the Institute of Systems Science of Academia Sinica (Beijing, China) under the project ME 418 of the Czech Ministery of Education. These authors are partly supported by the project LN00A056 of the Czech Ministery of Education.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Chen, C., Čada, R., Kaiser, T. et al. Short Disjoint Paths in Locally Connected Graphs. Graphs and Combinatorics 23, 509–519 (2007). https://doi.org/10.1007/s00373-007-0754-8

Download citation

Keywords

  • Connectivity
  • local connectivity
  • diameter
  • disjoint paths