Ohba's conjecture is true for graphs with independence number at most three
暂无分享,去创建一个
[1] Benny Sudakov,et al. List Colouring When The Chromatic Number Is Close To the Order Of The Graph , 2004, Comb..
[2] Douglas R. Woodall,et al. List colourings of graphs , 2001 .
[3] Sylvain Gravier,et al. Graphs whose choice number is equal to their chromatic number , 1998 .
[4] Zsolt Tuza,et al. Graph colorings with local constraints - a survey , 1997, Discuss. Math. Graph Theory.
[5] Kyoji Ohba. On chromatic-choosable graphs , 2002 .
[6] Daniel W. Cranston,et al. Choice number of complete multipartite graphs , 2008 .
[7] Yufa Shen,et al. On choosability of some complete multipartite graphs and Ohba's conjecture , 2008, Discret. Math..
[8] Kyoji Ohba. Choice Number of Complete Multipartite Graphs with Part Size at Most Three , 2004, Ars Comb..
[9] Hal A. Kierstead,et al. On the choosability of complete multipartite graphs with part size three , 2000, Discret. Math..