Crossing number is hard for cubic graphs

Petr Hlinený. Crossing number is hard for cubic graphs. Journal of Combinatorial Theory, Series A, 96(4):455-471, 2006. [doi]

@article{Hlineny06a,
  title = {Crossing number is hard for cubic graphs},
  author = {Petr Hlinený},
  year = {2006},
  doi = {10.1016/j.jctb.2005.09.009},
  url = {http://dx.doi.org/10.1016/j.jctb.2005.09.009},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Hlineny06a},
  cites = {0},
  citedby = {0},
  journal = {Journal of Combinatorial Theory, Series A},
  volume = {96},
  number = {4},
  pages = {455-471},
}