Mohar's Kempe-equivalence conjecture for edge-colourings

Let $G$ be a simple graph. Two $k$-edge-colourings are Kempe-equivalent if one can be reached from the other through a series of Kempe changes using colours from $\{1,\ldots,k\}$. Mohar's conjecture. All $(\Delta(G)+2)$-edge-colourings of $G$ 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.