On the number of 4-contractible edges in 4-connected graphs

  • Authors:

  • K. Ando;Y. Egawa;K. Kawarabayashi;Matthias Kriesell

  • Affiliations:

  • Univ. Electro-Communications, 1-5-1 Chofugaoka Chofu-shi, Tokyo 182-8585, Japan;Science University of Tokyo, Shinjuku-ku, Tokyo 162, Japan;National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo 101-8430, Japan;Mathematisches Seminar der Universität Hamburg, Bundesstraße 55, D-20146 Hamburg, Germany

  • Venue:
  • Journal of Combinatorial Theory Series B
  • Year:
  • 2009

Quantified Score

Hi-index 0.02

Visualization

Abstract

We prove that every finite 4-connected graph G has at least 134@?(|E(G)|-2|V(G)|) many contractible edges.