The asymptotic behavior of the correspondence chromatic number
暂无分享,去创建一个
[1] N. Alon. Degrees and choice numbers , 2000 .
[2] Luke Postle,et al. List-coloring embedded graphs without cycles of lengths 4 to 8 , 2015 .
[3] Carsten Thomassen,et al. 3-List-Coloring Planar Graphs of Girth 5 , 1995, J. Comb. Theory B.
[4] Oleg V. Borodin,et al. Colorings of plane graphs: A survey , 2013, Discret. Math..
[5] Carsten Thomassen,et al. Every Planar Graph Is 5-Choosable , 1994, J. Comb. Theory B.
[6] B. Reed. Graph Colouring and the Probabilistic Method , 2001 .
[7] Luke Postle,et al. Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 , 2015, J. Comb. Theory B.
[8] Anton Bernshteyn. The Local Cut Lemma , 2017, Eur. J. Comb..
[9] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.