1. Every planar map is four colorable. I. Discharging;Appel;Ill. J. Math.,1977
2. Every planar map is four colorable. II. Reducibility;Appel;Ill. J. Math.,1977
3. A proof of B. Grünbaum's conjecture on the acyclic 5-colorability of planar graphs;Borodin;Dokl. Akad. Nauk SSSR,1976
4. On the partition of a planar graph of girth 5 into an empty and an acyclic subgraph;Borodin;Diskretn. Anal. Issled. Oper., Ser.,2001
5. Near-proper vertex 2-colorings of sparse graphs;Borodin;J. Appl. Ind. Math.,2010