Choice Number of Some Complete Multi-partite Graphs
Yang Xu · Huadong Shifan Daxue xuebao. Ziran kexue ban · 2007
This paper investigated the choice number of some complete k-partite graphs, pointed out and corrected some mistakes of S.Gravier,H.Enomoto,et al..The choice number of the complete k-partite graph K(4,2,…,2) were determined,and also presented were a type of complete multi-partite graphs whose choice numbers are not equal to their chromatic numbers.