1. Solution of Ringel's problem about vertex bound colouring of planar graphs and colouring of 1-planar graphs;Borodin;Metody Diskret. Analiz.,1984
2. A new proof of the 6-color theorem;Borodin;J. Graph Theory,1995
3. Acyclic colouring of 1-planar graphs;Borodin;Discrete Anal. Oper. Res.,1999
4. Approximation algorithms for independent sets in map graphs;Chen;J. Algorithms,2001
5. Z.-Z. Chen, New bounds on the number of edges in a k-map Graph, Lecture Notes in Computer Science, vol. 3106, Springer, Berlin, 2004, pp. 319–328.