Exploring the world of edge-chromatic 3-critical graphs

Le Chen, Songling Shan

A graph $G$ with maximum degree $\Delta$ is $\Delta$-critical if it is connected, satisfies ${\chi }^{\prime }(G)=\Delta +1$, and the deletion of any edge reduces its chromatic index to $\Delta$. A $\Delta$-critical graph…