Vizing's edge-recoloring conjecture

Let $G$ be a graph, let $\Delta(G)$ denote its maximum degree, and let a proper edge-coloring be a coloring of the edges in which adjacent edges receive different colors. Two edge-colorings are equivalent if one can be transformed into the other by a sequence of Kempe swaps.

Vizing's conjecture. Every $k$-edge-coloring of a graph $G$ is equivalent to a $\Delta(G)$-edge-coloring of $G$ if there is any.

This conjecture asks whether every edge-coloring can be reconfigured to an optimal edge-coloring whenever one exists. The supplied source does not state whether it is resolved.