arXiv Analytics

Sign in

arXiv:1901.09955 [math.CO]AbstractReferencesReviewsResources

Graphs with at most one crossing

André C. Silva, Alan Arroyo, R. Bruce Richter, Orlando Lee

Published 2019-01-28Version 1

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.

Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1210.6161 [math.CO] (Published 2012-10-23)
An upper bound for the crossing number of augmented cubes
arXiv:1907.06245 [math.CO] (Published 2019-07-14)
A new bound for the crossing number of wrapped butterflies
arXiv:math/0404142 [math.CO] (Published 2004-04-06)
Improved bounds for the crossing numbers of K_m,n and K_n

Links

Toolbox