$k$-Planar Graphs

A simple topological graph is $k$-quasiplanar ($k\geq 2$) if it contains no $k$ pairwise crossing edges, and $k$-planar if no edge is crossed more than k times. In this paper, we explore the relationship between $k$-planarity and $k$-quasiplanarity …

A simple topological graph is $k$-quasiplanar ($k\geq 2$) if it contains no $k$ pairwise crossing edges, and $k$-planar if no edge is crossed more than k times. In this paper, we explore the relationship between $k$-planarity and $k$-quasiplanarity …