Barát, J., J. Matoušek, and D. R. Wood. “Bounded-Degree Graphs Have Arbitrarily Large Geometric Thickness”. The Electronic Journal of Combinatorics, Vol. 13, no. 1, Jan. 2006, p. R3, doi:10.37236/1029.