A Hajós-like theorem for list coloring (Q1917503)

\textit{G. Hajós} [Wiss. Z. Martin Luther Univ., Math.-Natur. Reihe 10, 116-117 (1961)] showed that every graph which is not \(q\)-colorable can be obtained from the complete graph \(K_{q + 1}\), by a sequence of operations of three types. The present author proves an analogue of this theorem for the list-chromatic number, applying again three operations (two of which agree with those of Hajós; the third is a variant), but now starting with a complete bipartite graph.