Bounded-degree graphs have arbitrarily large geometric thickness.
Barát, János ; Matoušek, Jirí ; Wood, David R.
The Electronic Journal of Combinatorics [electronic only], Tome 13 (2006), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2006-01-01
EUDML-ID : urn:eudml:doc:125522 
@article{02248148,
     title = {Bounded-degree graphs have arbitrarily large geometric thickness.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {13},
     year = {2006},
     zbl = {1080.05063},
     language = {en},
     url = {http://dml.mathdoc.fr/item/02248148}
}

Barát, János; Matoušek, Jirí; Wood, David R. Bounded-degree graphs have arbitrarily large geometric thickness.. The Electronic Journal of Combinatorics [electronic only], Tome 13 (2006) . http://gdmltest.u-ga.fr/item/02248148/