1. Parameterized complexity of 1-planarity;Bannister,2013
2. A new proof of the 6 color theorem;Borodin;J. Graph Theory,1995
3. Acyclic colouring of 1-planar graphs;Borodin;Discrete Appl. Math.,2001
4. On the density of maximal 1-planar graphs;Brandenburg,2013
5. Adding one edge to planar graphs makes crossing number hard;Cabello,2010