1. Erdo˝s, P., Rubin, A.L. and Taylor, H. (1979) Choosability in Graphs. Congressus Numeran- tium, 26, 125-127.
2. Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
3. Bernshteyn, A. and Kostochka, A. (2018) On Differences between DP-Coloring and List Col- oring. Siberian Advances in Mathematics, 21, 61-71.
4. Bernshteyn, A. and Lee, E. (2021) Weak Degeneracy of Graphs. arXiv:2111.05908
5. Every Planar Graph Is 5-Choosable