Edge Partitions of Optimal $2$-plane and $3$-plane Graphs

Michael Bekos, Emilio Di Giacomo, Walter Didimo +3

A topological graph is a graph drawn in the plane. A topological graph is $k$-plane, $k>0$, if each edge is crossed at most $k$ times. We study the problem of partitioning the edge…