On the relationship between k-planar and k-quasi-planar graphs

From MaRDI portal
(Redirected from Publication:1687902)
On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs




Abstract: A graph is k-planar (kgeq1) if it can be drawn in the plane such that no edge is crossed more than k times. A graph is k-quasi planar (kgeq2) 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 kgeq3, every k-planar graph is (k+1)-quasi planar.









This page was built for publication: On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1687902)