Independence number of edge-chromatic critical graphs

Yan Cao, Guantao Chen, Guangming Jing +1

Let $G$ be a simple graph with maximum degree $\Delta (G)$ and chromatic index ${\chi }^{\prime }(G)$. A classic result of Vizing indicates that either ${\chi }^{\prime }(G)=\Delta (G)$ or ${\chi }^{\prime }(G)=\Delta (G)+1$. The graph $G$ i…