Even factors in edge-chromatic-critical graphs with a small number of divalent vertices

Eckhard Steffen, Isaak H. Wolf

A finite simple connected graph $G$ with maximum degree $k$ is $k$-critical if it has chromatic index ${\chi }^{\prime }(G)=k+1$ and ${\chi }^{\prime }(G-e)=k$ for every edge $e\in E(G)$. Bej and the first auth…