Extended core and choosability of a graph

Yves Aubry, Godin Jean-Christophe, Togni Olivier

A graph $G$ is $(a,b)$-choosable if for any color list of size $a$ associated with each vertices, one can choose a subset of $b$ colors such that adjacent vertices are colored with…