LIST COLORING OF COMPLETE MULTIPARTITE GRAPHS
Vetr ́ õk · 2012
The choice number of a graph G is the smallest integer k such that for every assignment of a list L(v) of k colors to each vertex v of G, there is a proper coloring of G that assigns to each vertex v a color from L(v). We present upper and lower bounds on the choice number of complete multipartite graphs with partite classes of equal sizes and complete r-partite graphs with r − 1 partite classes of order two.