Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness

János Barát, Jirí Matousek, David R. Wood. Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness. Electr. J. Comb., 13(1), 2006. [doi]

@article{BaratMW06,
  title = {Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness},
  author = {János Barát and Jirí Matousek and David R. Wood},
  year = {2006},
  url = {http://www.combinatorics.org/Volume_13/Abstracts/v13i1r3.html},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BaratMW06},
  cites = {0},
  citedby = {0},
  journal = {Electr. J. Comb.},
  volume = {13},
  number = {1},
}