Claw-free perfect graphs are chromatic-choosable.Research Paper
List colouring was introduced by Vizing (1976) and by Erdős, Rubin and Taylor (1980): every vertex receives its own list of admissible colours, and a colouring must pick from each list. The choice number is the least for which lists of size always suffice. Since all lists may be equal, , and is chr…