1. O. V. Borodin, “Proof of Grunbaum’s Conjecture on the Acyclic 5-Colorability of Planar Graphs,” Dokl. Akad. Nauk SSSR 231, 18–20 (1976).
2. O. V. Borodin, “Acyclic 3-Choosability of Planar Graphs with No Cycles with Length from 4 to 12,” Diskret. Anal. Issled. Oper. 16(5), 26–32 (2009).
3. A. V. Kostochka, “Acyclic 6-Coloring of Planar Graphs,” Metody Diskretn. Anal. 28, 40–56 (1976).
4. H. L. Abbott and B. Zhou, “On Small Faces in 4-Critical Graphs,” Ars Combinatoria 32, 203–207 (1991).
5. M. O. Albertson and D. Berman, “Every Planar Graph Has an Acyclic 7-Coloring,” Israel J. Math. 28, 169–177 (1977).