华东师范大学学报（自然科学版）Issue(1)：56-61,6.
一些完全多部图的选择数
Choice Number of Some Complete Multi-partite Graphs
许洋1
作者信息
- 1. 中国矿业大学,理学院,江苏,徐州,221008;莱阳农学院,理学院,山东,青岛,266109
- 折叠
摘要
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
list coloring/complete multi-partite graphs/choice number分类
数理科学引用本文复制引用
许洋..一些完全多部图的选择数[J].华东师范大学学报（自然科学版）,2007,(1):56-61,6.
