Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum ?
We characterize the graphs G such that , where Ch(G) is the choice number (list-chromatic number) of G and n is its number of vertices.
graph coloring list coloring