1. A unified approach to distance-two colouring of planar graphs;Amini;Combinatorica,2013
2. Every planar map is four colorable. I. Discharging;Appel;Illinois J. Math.,1977
3. Every planar map is four colorable. II. Reducibility;Appel;Illinois J. Math.,1977
4. Solution of Ringel’s problems on vertex-face coloring of plane graphs and coloring of 1-planar graphs (in Russian);Borodin;Met. Diskret. Anal.,1984
5. Cyclic coloring of plane graphs;Borodin;Discrete Math.,1992