Mohar's Kempe-equivalence conjecture for edge-colourings
Statement
Let be a simple graph. Two -edge-colourings are Kempe-equivalent if one can be reached from the other through a series of Kempe changes using colours from . Mohar's conjecture. All -edge-colourings of are Kempe-equivalent. This conjecture would strengthen Vizing's question, which asks whether every edge-colouring using more than the chromatic index can be reduced to an optimal colouring by Kempe changes. Its status is not resolved in the supplied source context.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.