Partition of graphs with condition on the connectivity and minimum degree

Combinatorica volume 3, pages95–99(1983)Cite this article

Abstract

C. Thomassen and M. Szegedy proved the existence of a functionf(s, t) such that the points of anyf(s, t)-connected graph have a decomposition into two non-empty sets such that the subgraphs induced by them ares-connected andt-connected, respectively. We prove, thatf(s, t) ≦ 4s+4t − 13 and examine a similar problem for the minimum degree.

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

Access options

Buy single article

Instant access to the full article PDF.

US$ 39.95

Tax calculation will be finalised during checkout.

References

  1. [1]

    C. Thomassen, Graph decomposition with constraints on the connectivity and minimum degree,J. Graph Theory, to appear.

  2. [2]

    W. Mader, Existenzn-fach zusammenhängender Teilgraphen in Graphen genügend grossen Kantendichte,Abh. Math. Sem. Hamburg Univ. 37 (1972), 86–97.

    MATH  MathSciNet  Article  Google Scholar 

  3. [3]

    M. Szegedy, unpublished.

Download references

Author information

Affiliations

  1. Bolyai Institute of A. József University, Aradi vértanúk t. 1, H-6720, Szeged, Hungary

    Péter Hajnal

Authors
  1. Péter Hajnal
    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

Hajnal, P. Partition of graphs with condition on the connectivity and minimum degree. Combinatorica 3, 95–99 (1983). https://doi.org/10.1007/BF02579344

Download citation

AMS subject classification (1980)

  • 05 C 40