On the upper bound of the independence number of edge chromatic critical graphs
Lianying Miao · Journal of Xuzhou Normal University · 2010
In 1968,Vizing conjectured that for any edge chromatic critical graph G of order n with maximum degree Δ,its independence number α(G)≤n2.In this paper,by using Vizing adjacency lemma and the method in the proof of Fiorini inequality,it is proved that if in some maxmal independent set of G the number of major vertices is no more than one,then the conjecture is true.