Title of article
Choice number of some complete multi-partite graphs Original Research Article
Author/Authors
Hikoe Enomoto، نويسنده , , Kyoji Ohba، نويسنده , , Katsuhiro Ota، نويسنده , , Junko Sakamoto، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
12
From page
55
To page
66
Abstract
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.
Keywords
List coloring , Complete multi-partite graphs
Journal title
Discrete Mathematics
Serial Year
2002
Journal title
Discrete Mathematics
Record number
949913
Link To Document