1. Borodin, O.V., Glebov, A.N.: A sufficient condition for planar graphs to be $$3$$-colorable. Diskret. Anal. Issled. Oper. 10, 3–11 (2004)
2. Borodin, O.V., Glebov, A.N.: Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable. J. Graph Theory 66, 1–31 (2011)
3. Borodin, O.V., Raspaud, A.: A sufficient condition for planar graphs to be $$3$$-colorable. J. Comb. Theory Ser. B 88, 17–27 (2003)
4. Borodin, O.V., Glebov, A.N., Raspaud, A.R., Salavatipour, M.R.: Planar graphs without cycles of length from 4 to 7 are 3-colorable. J. Comb. Theory Ser. B 93, 303–311 (2005)
5. Borodin, O.V., Glebov, A.N., Jensen, T.R., Raspaud, A.: Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable. Sib. lektron. Mat. Izv. 3, 428–440 (2006)