[{"doi":"10.1016/j.disc.2019.06.031","language":[{"iso":"eng"}],"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"}],"author":[{"last_name":"Silva","full_name":"Silva, André ","first_name":"André "},{"orcid":"0000-0003-2401-8670","id":"3207FDC6-F248-11E8-B48F-1D18A9856A87","first_name":"Alan M","full_name":"Arroyo Guevara, Alan M","last_name":"Arroyo Guevara"},{"last_name":"Richter","full_name":"Richter, Bruce","first_name":"Bruce"},{"last_name":"Lee","full_name":"Lee, Orlando","first_name":"Orlando"}],"type":"journal_article","day":"01","title":"Graphs with at most one crossing","ec_funded":1,"citation":{"short":"A. Silva, A.M. Arroyo Guevara, B. Richter, O. Lee, Discrete Mathematics 342 (2019) 3201–3207.","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>","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>","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.","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>.","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>."},"status":"public","intvolume":"       342","quality_controlled":"1","department":[{"_id":"UlWa"}],"publication":"Discrete Mathematics","isi":1,"publisher":"Elsevier","date_created":"2019-07-14T21:59:20Z","month":"11","page":"3201-3207","publication_identifier":{"issn":["0012-365X"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_updated":"2023-08-29T06:31:41Z","scopus_import":"1","external_id":{"isi":["000486358100025"],"arxiv":["1901.09955"]},"oa_version":"Preprint","year":"2019","volume":342,"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1901.09955"}],"publication_status":"published","_id":"6638","date_published":"2019-11-01T00:00:00Z","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."}],"issue":"11","article_processing_charge":"No","arxiv":1}]