, Volume 6, Issue 3, pp 269–274 | Cite as

Contractible edges in triangle-free graphs

  • Yoshimi Egawa
  • Hikoe Enomoto
  • Akira Saito


An edge of a graph is calledk-contractible if the contraction of the edge results in ak-connected graph. Thomassen [5] proved that everyk-connected graph of girth at least four has ak-contractible edge. In this paper, we study the distribution ofk-contractible edges in triangle-free graphs and show the following: Whenk≧2, everyk-connected graph of girth at least four and ordern≧3k, hasn+(3/2)k 2-3k or morek-contractible edges.

AMS subject classification (1980)

05 C 40 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    K. Ando, H. Enomoto andA. Saito, Contractible edges in 3-connected graphs,submitted.Google Scholar
  2. [2]
    M. Behzad, G. Chartrand andL. Lesniak-Foster,Graphs and Digraphs, Prindle, Weber & Schmidt, Boston MA, 1979.Google Scholar
  3. [3]
    B. Bollobás,Graph Theory, Springer-Verlag, New York NY, 1979.zbMATHGoogle Scholar
  4. [4]
    C. Thomassen, Planarity and Duality of finite and infinite graphs,J. Combinatorial Theory Ser. B 29 (1980), 244–271.zbMATHCrossRefMathSciNetGoogle Scholar
  5. [5]
    C. Thomassen, Nonseparating cycles ink-connected graphs,J. Graph Theory 5 (1981), 351–354.zbMATHMathSciNetGoogle Scholar
  6. [6]
    C. Thomassen andB. Toft, Induced non-separating cycles in graphs.J. Combinatorial Theory Ser. B 31 (1981), 199–224.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Akadémiai Kiadó 1986

Authors and Affiliations

  • Yoshimi Egawa
    • 1
  • Hikoe Enomoto
    • 2
  • Akira Saito
    • 2
  1. 1.Dept. of Applied Math.Science University of TokyoTokyoJapan
  2. 2.Dept. of Information Science Faculty of ScienceUniversity of TokyoTokyoJapan

Personalised recommendations