Choice number of some complete multi-partite graphs
暂无分享,去创建一个
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.
[1] Sylvain Gravier,et al. Choice number of 3-colorable elementary graphs , 1997, Discret. Math..
[2] Fred Galvin,et al. The List Chromatic Index of a Bipartite Multigraph , 1995, J. Comb. Theory B.
[3] Sylvain Gravier,et al. Graphs whose choice number is equal to their chromatic number , 1998 .
[4] Hal A. Kierstead,et al. On the choosability of complete multipartite graphs with part size three , 2000, Discret. Math..