1. Degrees and choice numbers;Alon;Random Structures Algorithms,2000
2. A. Bernshteyn, The Johansson–Molloy Theorem for DP-Coloring, arXiv:1708.03843.
3. The asymptotic behavior of the correspondence chromatic number;Bernshteyn;Discrete Math.,2016
4. A. Bernshteyn, A. Kostochka, On differences between DP-coloring and list coloring, arXiv:1705.04883.
5. Sharp dirac’s theorem for DP-critical graphs;Bernshteyn;J. Graph Theory,2018