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