Advanced search
Start date
Betweenand
Related content
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Graphs with at most one crossing

Full text
Author(s):
Silva, Andre C. [1] ; Arroyo, Alan [2] ; Richter, R. Bruce [3] ; Lee, Orlando [1]
Total Authors: 4
Affiliation:
[1] Univ Estadual Campinas, Inst Comp, BR-13083852 Campinas, SP - Brazil
[2] IST Austria, A-3400 Klosterneuburg - Austria
[3] Univ Waterloo, Dept Combinator & Optimizat, Waterloo N2L 3G1, ON - Canada
Total Affiliations: 3
Document type: Journal article
Source: DISCRETE MATHEMATICS; v. 342, n. 11, p. 3201-3207, NOV 2019.
Web of Science Citations: 0
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. (C) 2019 Elsevier B.V. All rights reserved. (AU)

FAPESP's process: 14/14375-9 - The Crossing Number of Graphs
Grantee:André Carvalho Silva
Support Opportunities: Scholarships in Brazil - Doctorate
FAPESP's process: 15/04385-0 - Crossing number of graphs in arbitrary surfaces
Grantee:André Carvalho Silva
Support Opportunities: Scholarships abroad - Research Internship - Doctorate
FAPESP's process: 15/11937-9 - Investigation of hard problems from the algorithmic and structural stand points
Grantee:Flávio Keidi Miyazawa
Support Opportunities: Research Projects - Thematic Grants