Journal of East China Normal University(Natural Sc ›› 2015, Vol. 2015 ›› Issue (1): 114-119.doi: 10.3969/j.issn.1000-5641.2015.01.013

• Article • Previous Articles     Next Articles

On the independence number of edge chromatic critical graphs

 QI  Lin-Ming, MIAO  Lian-Ying, LI  Wei-Qi   

  1. College of Sciences, China University of Mining and Technology, Xuzhou Jiangsu 221116, China
  • Received:2014-03-01 Online:2015-01-25 Published:2015-03-29

Abstract: In 1968, Vizing conjectured for any edge chromatic critical graph G = (V,E) with maximum degree Δ and independence number α(G), α(G)≤|V|/2. In this paper, we proved that α(G) ≤(3Δ-3)/(5Δ-3)|V| for Δ∈{9,10} and α(G) ≤(15Δ-42)/(23Δ-42)|V| for Δ∈{11, · · · , 46}

Key words: edge coloring, critical graphs, independence number

CLC Number: