Application of polynomial method to on-line list colouring of graphs

A graph is on-line chromatic choosable if its on-line choice number equals its chromatic number. In this paper, we consider on-line chromatic-choosable complete multi-partite graphs. Assume GG is a complete kk-partite graph. It is known that if the polynomial P(G)P(G) defined as P(G)=∏u