TY - JOUR
T1 - Choice number of some complete multi-partite graphs
AU - Enomoto, Hikoe
AU - Ohba, Kyoji
AU - Ota, Katsuhiro
AU - Sakamoto, Junko
PY - 2002/2/6
Y1 - 2002/2/6
N2 - One of the authors has conjectured that every graph G with 2%(G) + 1 or fewer vertices is χ(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.
AB - One of the authors has conjectured that every graph G with 2%(G) + 1 or fewer vertices is χ(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.
KW - Complete
KW - List coloring
KW - Multi-partite graphs
UR - http://www.scopus.com/inward/record.url?scp=33750981870&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33750981870&partnerID=8YFLogxK
U2 - 10.1016/S0012-365X(01)00059-0
DO - 10.1016/S0012-365X(01)00059-0
M3 - Conference article
AN - SCOPUS:33750981870
SN - 0012-365X
VL - 244
SP - 55
EP - 66
JO - Discrete Mathematics
JF - Discrete Mathematics
IS - 1-3
T2 - Algebraic and Topological Methods in Graph Theory (ATMGT)
Y2 - 28 June 1999 through 2 July 1999
ER -