A new upper bound for the independence number of edge chromatic critical graphs
In 1968, Vizing conjectured that if G is a ?-critical graph with n vertices, then ?(G)?n/2, where ?(G) is the independence number of G. In this paper, we apply Vizing and Vizing-like adjacency lemmas to this problem and prove that ?(G)<(((5??6)n)/(8??6))<5n/8 if ??6.  2010 Wiley Periodicals, Inc. J Graph Theory 68: 202-212, 2011
independence number critical graphs edge coloring