The Geometric Thickness of Low Degree Graphs

Christian A. Duncan, David Eppstein, Stephen G. Kobourov

We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. All of our algorithms run in O(n) time, where n is the number of vertices in the g…