摘要
研究一些完全k-部图的选择数,并纠正了S．Gravier和H．Enomoto等人的一些错误．得到了完全k-部图K(4,2,…,2)的选择数,并指出了一类选择数不等于染色数的图．
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.
出处
《华东师范大学学报（自然科学版）》
CAS
CSCD
北大核心
2007年第1期56-61,共6页
Journal of East China Normal University(Natural Science)
关键词
列表染色
完全多部图
选择数
list coloring
complete multi-partite graphs
choice number
