On Optimal 2- and 3-Planar Graphs

Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou

A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices an…