Kempe equivalent list edge-colorings of planar graphs (Q6091809)

For a list assignment \(L\) and an \(L\)-coloring \(\varphi\), a Kempe swap in \(\varphi\) is said to be \(L\)-valid if it yields another \(L\)-coloring and two \(L\)-colorings are called \(L\)-equivalent if we can form one from another by a sequence of \(L\)-valid Kempe swaps. A graph \(G\) is said to be \(L\)-swappable if every two of its \(L\)-colorings are \(L\)-equivalent. In this paper, the author considers \(L\)-swappability of line graphs of planar graphs with large maximum degree. The results proved here are the following: \begin{itemize} \item[(i)] let \(G\) be a planar graph with \(\delta(G) \geq 9\) and let \(H\) be the line graph of \(G\). If \(L\) is a \((\Delta(G) +1)\)-assignment to \(H\), then \(H\) is \(L\)-swappable; \item[(ii)] let \(G\) be a planar graph with \(\Delta(G) \geq 15\) and let \(H\) be the line graph of \(G\). If \(L\) is a \(\Delta(G)\)-assignment to \(H\), then \( H\) is \(L\)-swappable. \end{itemize} The first result is analogous to one for \(L\)-choosability by \textit{O. V. Borodin} [Math. Notes 48, No. 6, 1186--1190 (1990; Zbl 0742.05039); translation from Mat. Zametki 48, No. 6, 22--28 (1990)], which was later strengthened by \textit{M. Bonamy} [SIAM J. Discrete Math. 29, No. 3, 1735--1763 (2015; Zbl 1321.05061)]. The second result is analogous to another for \(L\)-choosability by Borodin, which was later strengthened by \textit{O. V. Borodin} et al. [J. Comb. Theory, Ser. B 71, No. 2, 184--204 (1997; Zbl 0876.05032)].