Vertex-splitting and chromatic index critical graphs Original Research Article

We study graphs which are critical with respect to the chromatic index. We relate these to the Overfull Conjecture and we study in particular their construction from regular graphs by subdividing an edge or by splitting a vertex.