List recoloring of planar graphs

L. Sunil Chandran, Uttam K. Gupta, Dinabandhu Pradhan

A list assignment $L$ of a graph $G$ is a function that assigns to every vertex $v$ of $G$ a set $L(v)$ of colors. A proper coloring $\alpha$ of $G$ is called an $L$-coloring of $G$ if…