Skip to main content
SpringerLink
Log in

A family of path properties for graphs

  • Published:
Mathematische Annalen Aims and scope Submit manuscript

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Dirac, G. A.: Généralizations du théorème de Menger. C. R. Acad. Sci. Paris250, 4252–4253 (1960).

    Google Scholar 

  2. —— In abstrakten Graphen vorhandene vollständige 4-Graphen und ihre Unterteilungen. Math. Nachr.22, 61–85 (1960).

    Google Scholar 

  3. Halin, R.: Zur Theorie dern-fach zusammenhängenden Graphen. Abhand. Math. Sem. Univ. Hamburg33, 133–164 (1969).

    Google Scholar 

  4. —— Jung, H. A.: Note on isomorphisms of graphs, J. London Math. Soc.42, 254–256 (1967).

    Google Scholar 

  5. Harary, F.: Graph theory, First Ed. Reading Mass.: Addison-Wesley 1969.

    Google Scholar 

  6. Mesner, D. M., Watkins, M. E.: Some theorems aboutn-vertex connected graphs. J. Math. Mech.16, 321–326 (1966).

    Google Scholar 

  7. Watkins, M. E.: On the existence of certain disjoint arcs in graphs. Duke Math. J.35, 231–246 (1968).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Vanderbilt University, 37203, Nashville, Tennessee, USA

    E. L. Wilson, R. L. Hemminger & M. D. Plummer

Authors
  1. E. L. Wilson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. L. Hemminger
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. D. Plummer
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wilson, E.L., Hemminger, R.L. & Plummer, M.D. A family of path properties for graphs. Math. Ann. 197, 107–122 (1972). https://doi.org/10.1007/BF01419587

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01419587

Keywords

Search

Navigation