Vertex-splitting and chromatic index critical graphs (Q1363752)

The authors propose the following conjecture. Let \(G\) be a connected regular graph of Class 1 with \(\Delta(G)\geq|V(G)|/3\), and let \(G^*\) be obtained by splitting a vertex of \(G\) into two vertices. Then \(G\) is a chromatic index critical graph. It is shown that the well-known overfull conjecture [\textit{A. J. W. Hilton}, Discrete Math. 64, 303-307 (1987; Zbl 0622.05021)] implies the above conjecture. Some related results are also proved.