1. Bernshteyn, A., Kostochka, A., Pron, S.: On DP-coloring of graphs and multigraphs. Sib. Math. J. 58, 28–36 (2017)
2. Borodin, O.V.: A proof of Grünbaum’s conjecture on the acyclic $$5$$-colorability of planar graphs. Dokl. Akad. Nauk SSSR 231, 18–20 (1976)
3. Borodin, O.V., Glebov, A.N.: On the partition of a planar graph of girth $$5$$ into an empty and an acyclic subgraph. Diskret. Anal. Issledovanie Oper. 8(4), 34–53 (2001). (in Russian)
4. Borodin, O.V., Kostochka, A.V.: Defective 2-colorings of sparse graphs. J. Combin. Theory Ser. B 104, 72–80 (2014)
5. Chappell, G.G., Gimbel, J., Hartman, C.: Thresholds for path colorings of planar graphs. Algorithms Combin. 26, 435–454 (2006)