Abstract
A finite simple connected graph G with maximum degree k is k-critical if it has chromatic index $$\chi '(G)=k+1$$ χ ′ ( G ) = k + 1 and $$\chi '(G-e)=k$$ χ ′ ( G - e ) = k for every edge $$e\in E(G)$$ e ∈ E ( G ) . Bej and the first author [2] raised the question whether every k-critical graph has an even factor. We prove that every k-critical graphs with at most $$2k-6$$ 2 k - 6 vertices of degree 2 has an even factor.
Funding Information
  • Deutsche Forschungsgemeinschaft (STE 792/3-1)
  • Universität Paderborn