Abstract :
We study an analogue of Hajósʹ theorem for list coloring which states that each non-k-choosable graph can be obtained from any non-k-choosable complete bipartite graph by a certain set of graph operations. We show that one of the operations of the original set, namely Hajós sum, can be left out.
