---
_id: '6638'
abstract:
- lang: eng
  text: 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.
article_processing_charge: No
arxiv: 1
author:
- first_name: 'André '
  full_name: 'Silva, André '
  last_name: Silva
- first_name: Alan M
  full_name: Arroyo Guevara, Alan M
  id: 3207FDC6-F248-11E8-B48F-1D18A9856A87
  last_name: Arroyo Guevara
  orcid: 0000-0003-2401-8670
- first_name: Bruce
  full_name: Richter, Bruce
  last_name: Richter
- first_name: Orlando
  full_name: Lee, Orlando
  last_name: Lee
citation:
  ama: Silva A, Arroyo Guevara AM, Richter B, Lee O. Graphs with at most one crossing.
    <i>Discrete Mathematics</i>. 2019;342(11):3201-3207. doi:<a href="https://doi.org/10.1016/j.disc.2019.06.031">10.1016/j.disc.2019.06.031</a>
  apa: Silva, A., Arroyo Guevara, A. M., Richter, B., &#38; Lee, O. (2019). Graphs
    with at most one crossing. <i>Discrete Mathematics</i>. Elsevier. <a href="https://doi.org/10.1016/j.disc.2019.06.031">https://doi.org/10.1016/j.disc.2019.06.031</a>
  chicago: Silva, André , Alan M Arroyo Guevara, Bruce Richter, and Orlando Lee. “Graphs
    with at Most One Crossing.” <i>Discrete Mathematics</i>. Elsevier, 2019. <a href="https://doi.org/10.1016/j.disc.2019.06.031">https://doi.org/10.1016/j.disc.2019.06.031</a>.
  ieee: A. Silva, A. M. Arroyo Guevara, B. Richter, and O. Lee, “Graphs with at most
    one crossing,” <i>Discrete Mathematics</i>, vol. 342, no. 11. Elsevier, pp. 3201–3207,
    2019.
  ista: Silva A, Arroyo Guevara AM, Richter B, Lee O. 2019. Graphs with at most one
    crossing. Discrete Mathematics. 342(11), 3201–3207.
  mla: Silva, André, et al. “Graphs with at Most One Crossing.” <i>Discrete Mathematics</i>,
    vol. 342, no. 11, Elsevier, 2019, pp. 3201–07, doi:<a href="https://doi.org/10.1016/j.disc.2019.06.031">10.1016/j.disc.2019.06.031</a>.
  short: A. Silva, A.M. Arroyo Guevara, B. Richter, O. Lee, Discrete Mathematics 342
    (2019) 3201–3207.
date_created: 2019-07-14T21:59:20Z
date_published: 2019-11-01T00:00:00Z
date_updated: 2023-08-29T06:31:41Z
day: '01'
department:
- _id: UlWa
doi: 10.1016/j.disc.2019.06.031
ec_funded: 1
external_id:
  arxiv:
  - '1901.09955'
  isi:
  - '000486358100025'
intvolume: '       342'
isi: 1
issue: '11'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1901.09955
month: '11'
oa: 1
oa_version: Preprint
page: 3201-3207
project:
- _id: 26366136-B435-11E9-9278-68D0E5697425
  name: Reglas de Conectividad funcional en el hipocampo
- _id: 260C2330-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '754411'
  name: ISTplus - Postdoctoral Fellowships
publication: Discrete Mathematics
publication_identifier:
  issn:
  - 0012-365X
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Graphs with at most one crossing
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 342
year: '2019'
...