Choice number of some complete multi-partite graphs

被引：23
|
作者：
Enomoto, H [1 ]
Ohba, K [1 ]
Ota, K [1 ]
Sakamoto, J [1 ]
机构：
[1] Keio Univ, Dept Math, Kohoku Ku, Yokohama, Kanagawa 2238522, Japan
来源：
DISCRETE MATHEMATICS | 2002年 / 244卷 / 1-3期
关键词：
list coloring; complete multi-partite graphs;
D O I：
10.1016/S0012-365X(01)00059-0
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
One of the authors has conjectured that every graph G with 2chi(G) + 1 or fewer vertices is chi(G)-choosable. Motivated by this, we investigate the choice numbers of some complete k-partite graphs of order slightly larger than 2k, and settle the conjecture for some special cases. We also present several complete multi-partite graphs whose choice numbers are not equal to their chromatic numbers. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：55 / 66
页数：12
相关论文
共 50 条
12345