1. On the maximum number of edges in topological graphs with no four pairwise crossing edges;Ackerman;Discrete Comput. Geom.,2009
2. P. Angelini, M. Bekos, F. Brandenburg, G. Da Lozzo, G. Di Battista, W. Didimo, G. Liotta, F. Montecchiani, I. Rutter, The relationship between k-planar and k-quasi planar graphs, arXiv:1702.08716 [cs.CG].
3. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebr. Discrete Methods,1987
4. Parameterized complexity of 1-planarity;Bannister,2013
5. A partial k-arboretum of graphs with bounded treewidth;Bodlaender;Theoret. Comput. Sci.,1998