1. Degrees and choice numbers;Alon;Random Struct. Algorithms,2000
2. The Probabilistic Method;Alon,1992
3. A. Bernshteyn, The Local Cut Lemma, 2016. arXiv:1601.05481 preprint.
4. Colorings of plane graphs: A survey;Borodin;Discrete Math.,2013
5. Z. Dvořák, L. Postle, List-coloring embedded graphs without cycles of lengths 4 to 8, 2015. arXiv:1508.03437, preprint.