Bounded-degree graphs have arbitrarily large geometric thickness (0)

by J Barát, J Matouˇsek, D R Wood
Venue:Electronic J. Combinatorics