A new improvement to the Overfull Conjecture

Xuli Qi, Chunhui Ge, Yanrui Feng

Let $G$ be a simple graph with order $n$, maximum degree $\D(G)$, minimum degree $\delta (G)$ and chromatic index ${\chi }^{\prime }(G)$, respectively. A graph $G$ is called {\em $\D$-critical} if $χ'(…