Free choosability of the cycle

Yves Aubry, Jean-Christophe Godin, Olivier Togni

A graph $G$ is free $(a,b)$-choosable if for any vertex $v$ with $b$ colors assigned and for any list of colors of size $a$ associated with each vertex $u\ne v$, the coloring can b…