Overfullness of edge-critical graphs with small minimal core degree

Yan Cao, Guantao Chen, Guangming Jing +1

Let $G$ be a simple graph. Denote by $n$, $\Delta (G)$ and ${\chi }^{\prime }(G)$ be the order, the maximum degree and the chromatic index of $G$, respectively. We call $G$ \emph{overfull} if $|E(G)|/…