1. Every planar map is four colorable Part I: discharging;Appel;Ill. J. Math.,1977
2. Every planar map is four colorable Part II: reducibility;Appel;Ill. J. Math.,1977
3. Solution of the Ringel problem on vertex-face coloring of planar graphs and coloring of 1-planar graphs;Borodin;Metody Diskret. Anal.,1984
4. A new proof of the 6 color theorem;Borodin;J. Graph Theory,1995
5. Acyclic colouring of 1-planar graphs;Borodin;Discrete Appl. Math.,2001