Journal of East China Normal University(Natural Sc ›› 2007, Vol. 2007 ›› Issue (1): 56-61.

• Article • Previous Articles     Next Articles

Choice Number of Some Complete Multi-partite Graphs(English)

XU Yang1,2   

  1. 1. College of Sciences, China University of Mining and Technology, Xuzhou Jiangsu 221008, China; 2. School of Sciences, Laiyang Agricultural University, Qingdao Shandong 266109, China
  • Received:2005-10-18 Revised:2006-03-17 Online:2007-01-25 Published:2007-01-25
  • Contact: XU Yang

Abstract: 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.

Key words: complete multi-partite graphs, choice number, list coloring, complete multi-partite graphs, choice number