Graphs with at most one crossing

A. Silva, A.M. Arroyo Guevara, B. Richter, O. Lee, Discrete Mathematics (2019).


Journal Article | Epub ahead of print | English
Author
; ; ;
Department
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.
Publishing Year
Date Published
2019-07-03
Journal Title
Discrete Mathematics
IST-REx-ID

Cite this

Silva A, Arroyo Guevara AM, Richter B, Lee O. Graphs with at most one crossing. Discrete Mathematics. 2019. doi:10.1016/j.disc.2019.06.031
Silva, A., Arroyo Guevara, A. M., Richter, B., & Lee, O. (2019). Graphs with at most one crossing. Discrete Mathematics. https://doi.org/10.1016/j.disc.2019.06.031
Silva, André , Alan M Arroyo Guevara, Bruce Richter, and Orlando Lee. “Graphs with at Most One Crossing.” Discrete Mathematics, 2019. https://doi.org/10.1016/j.disc.2019.06.031.
A. Silva, A. M. Arroyo Guevara, B. Richter, and O. Lee, “Graphs with at most one crossing,” Discrete Mathematics, 2019.
Silva A, Arroyo Guevara AM, Richter B, Lee O. 2019. Graphs with at most one crossing. Discrete Mathematics.
Silva, André, et al. “Graphs with at Most One Crossing.” Discrete Mathematics, Elsevier, 2019, doi:10.1016/j.disc.2019.06.031.

Link(s) to Main File(s)
Access Level
OA Open Access

Export

Marked Publications

Open Data IST Research Explorer

Sources

arXiv 1901.09955

Search this title in

Google Scholar