Correspondence Coloring and Its Application to List-Coloring Planar Graphs Without Cycles of Lengths 4 to 8: Every Planar Graph Without Cycles of Lengths 4 to 8 Is 3-ChoosableResearch Paper
List colouring asks for a proper colouring of a graph in which every vertex takes its colour from its own prescribed list. A graph is -choosable if such a colouring exists for every assignment of lists of size . Choosability is harder to guarantee than colourability: planar triangle-free graphs are 3-colourable (Grötzsch) but not all are 3-choosable…