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.
|出版ステータス||Published - 2002 2月 6|
|イベント||Algebraic and Topological Methods in Graph Theory (ATMGT) - Lake Bled, Slovenia|
継続期間: 1999 6月 28 → 1999 7月 2
ASJC Scopus subject areas