2017/02/28 by Angelini, Patrizio, Bekos, Michael A., Brandenburg, Franz J. +6
#Computational Geometry (cs.CG) #FOS: Computer and information sciences
paper · doi:10.48550/arxiv.1702.08716
A graph is k-planar (k ≥ 1) if it can be drawn in the plane such that no edge is crossed more than k times. A graph is k-quasi planar (k ≥ 2) if it can be drawn in the plane with no k pairwise crossing edges. The families of k-planar and k-quasi planar graphs have been widely studied in the literature, and several bounds have been proven on their edge density. Nonetheless, only trivial results are known about the relationship between these two graph families. In this paper we prove that, for k ≥ 3, every k-planar graph is (k+1)-quasi planar.