Exploring the world of edge-chromatic 3-critical graphs

Le Chen, Songling Shan

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