Skip to main content
SpringerLink
Log in

Contractible edges inn-connected graphs with minimum degree greater than or equal to [5n/4]

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

It is proved that ifG is ann-connected graph with minimum degree greater than or equal to [5n/4],n ≥ 4, thenG has an edgee such that the graph obtained fromG by contractinge is stilln-connected.

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

Similar content being viewed by others

References

  1. Ando, K., Enomoto, H., Saito, A.: Contractible edges in 3-connected graphs. J. Comb. Theory Ser. B42, 87–93 (1987)

    Google Scholar 

  2. Egawa, Y., Enomoto, H., Saito, A.: Contractible edges in triangle-free graphs. Combinatorica6, 269–274 (1986)

    Google Scholar 

  3. Entringer, R.C., Slater, P.J.: A note onk-criticallyn-connected graphs. Proc. Am. Math. Soc.66, 372–375 (1977)

    Google Scholar 

  4. Mader, W.: Disjunkte Fragmente in kritischn-fach zusammenhangenden Graphen. Eur. J. Comb. (to appear)

  5. Mader, W.: Eine Eigenschaft der Atome endlicher Graphen. Arch. Math.22, 333–336 (1971)

    Google Scholar 

  6. Mader, W.: Onk-criticallyn-connected graphs. Progress in Graph Theory (Bondy, J.A., Murty, U.S.R., eds.), pp. 389–398. Ontario: Academic Press Canada 1984

    Google Scholar 

  7. Saito, A.: Contractible edges in graphs with large minimum degree. (preprint)

  8. Su, J.: On some properties of criticallyh-connected graphs andk-criticallyh-connected graphs. (preprint)

  9. Thomassen, C.: Nonseparating cycles ink-connected graphs. J. Graph Theory5, 351–354 (1981)

    Google Scholar 

  10. Thomassen, C.: Planarity and duality of finite and infinite graphs. J. Comb. Theory Ser. B29, 244–271 (1980)

    Google Scholar 

  11. Thomassen, C., Toft, B.: Induced non-separating cycles in graphs, J. Comb. Theory Ser. B31, 199–224 (1981)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Science University of Tokyo, Shinjuku-ku, 162, Tokyo, Japan

    Yoshimi Egawa

Authors
  1. Yoshimi Egawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Dedicated to Professor Nagayoshi Iwahori on his 60th birthday

Rights and permissions

Reprints and permissions

About this article

Cite this article

Egawa, Y. Contractible edges inn-connected graphs with minimum degree greater than or equal to [5n/4]. Graphs and Combinatorics 7, 15–21 (1991). https://doi.org/10.1007/BF01789459

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation