@article{6638,
  abstract     = {The crossing number of a graph G is the least number of crossings over all possible drawings of G. We present a structural characterization of graphs with crossing number one.},
  author       = {Silva, André  and Arroyo Guevara, Alan M and Richter, Bruce and Lee, Orlando},
  issn         = {0012-365X},
  journal      = {Discrete Mathematics},
  number       = {11},
  pages        = {3201--3207},
  publisher    = {Elsevier},
  title        = {{Graphs with at most one crossing}},
  doi          = {10.1016/j.disc.2019.06.031},
  volume       = {342},
  year         = {2019},
}