Bipartite Graphs whose Squares are not Chromatic-Choosable
暂无分享,去创建一个
[1] Elyse Yeager,et al. A note on list-coloring powers of graphs , 2013, Discret. Math..
[2] Tomás Vetrík,et al. List coloring of complete multipartite graphs , 2012, Discuss. Math. Graph Theory.
[3] Alexandr V. Kostochka,et al. Choosability conjectures and multicircuits , 2001, Discret. Math..
[4] Richard M. Wilson,et al. A course in combinatorics , 1992 .
[5] Seog-Jin Kim,et al. Counterexamples to the List Square Coloring Conjecture , 2013, J. Graph Theory.
[6] Vetr ´ õk. LIST COLORING OF COMPLETE MULTIPARTITE GRAPHS , 2012 .
[7] Seog-Jin Kim,et al. Chromatic-choosability of the power of graphs , 2013, Discret. Appl. Math..
[8] Tommy R. Jensen,et al. Graph Coloring Problems , 1994 .
[9] Alexandr V. Kostochka,et al. List Edge and List Total Colourings of Multigraphs , 1997, J. Comb. Theory B.
[10] Noga Alon,et al. Choice Numbers of Graphs: a Probabilistic Approach , 1992, Combinatorics, Probability and Computing.
[11] D. de Werra,et al. Graph Coloring Problems , 2013 .
[12] Hal A. Kierstead,et al. On the choosability of complete multipartite graphs with part size three , 2000, Discret. Math..