Barát, J., Matoušek, J., & Wood, D. R. (2006). Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness. The Electronic Journal of Combinatorics, 13(1), R3. https://doi.org/10.37236/1029