Relating Graph Thickness to Planar Layers and Bend Complexity

Stephane Durocher, Debajyoti Mondal

The thickness of a graph $G=(V,E)$ with $n$ vertices is the minimum number of planar subgraphs of $G$ whose union is $G$. A polyline drawing of $G$ in ${\mathbb{R}}^2$ is a drawing $…