List coloring

Summary

List coloring is a form of graph colouring in which each vertex must take its colour from its own list of allowed colours. A graph is $k$-choosable if it can be coloured from any lists of size $k$, and the least such $k$ is its choice number. The choice number is at least the chromatic number, and it can be much larger.