Barát, János, Jiří Matoušek, and David R. Wood. “Bounded-Degree Graphs Have Arbitrarily Large Geometric Thickness”. The Electronic Journal of Combinatorics 13, no. 1 (January 7, 2006): R3. Accessed March 31, 2026. https://www.combinatorics.org/ojs/index.php/eljc/article/view/v13i1r3.