1. Coloring of plane graphs: a survey;Borodin;Discrete Math.,2013
2. Correspondence coloring and its application to list-coloring planar graphs without cycles of length 4 to 8;Dvořák;J. Combin. Theory Ser. B,2018
3. P. Erdős, A.L. Rubin, H. Taylor, Choosability in graphs, in: Proc. West Coast Conf. on Combinatorics, Graph Theory, and Computing, Congressus Numerantium XXVI, 1979, pp. 125–157.
4. Planar graphs without cycles of specific lengths;Fijavz;European J. Combin.,2002
5. S.J. Kim, K. Ozeki, A sufficient condition for DP-4-colorability, https://arxiv.org/abs/1709.09809.