English

Graphs with at most one crossing

Combinatorics 2021-08-24 v2

Abstract

The crossing number of a graph GG is the least number of crossings over all possible drawings of GG. We present a structural characterization of graphs with crossing number one.

Keywords

Cite

@article{arxiv.1901.09955,
  title  = {Graphs with at most one crossing},
  author = {André C. Silva and Alan Arroyo and R. Bruce Richter and Orlando Lee},
  journal= {arXiv preprint arXiv:1901.09955},
  year   = {2021}
}
R2 v1 2026-06-23T07:24:42.998Z