1. Every planar map is four colorable. Part I. Discharging;Appel;Illinois J. Math.,1977
2. Every planar map is four colorable. Part II. Reducibility;Appel;Illinois J. Math.,1977
3. On the total coloring of planar graphs;Borodin;J. Reine Angew. Math.,1989
4. (5, 2)-coloring of sparse graphs;Borodin;Sib. Elektron. Mat. Izv.,2008
5. Near proper 2-coloring the vertices of sparse graphs;Borodin;Diskretn. Anal. Issled. Oper.,2009