3 citations · 7 across the 10 of their papers we have counts for
4 papers · 1 filter
The unavoidable rotation systems
Alan Arroyo, R. Bruce Richter, Gelasio Salazar +1
For each positive integer , Pach, Solymosi, and Tóth identified two canonical complete topological subgraphs and , and proved that every sufficiently large topologica…
Inserting one edge into a simple drawing is hard
Alan Arroyo, Fabian Klute, Irene Parada +3
A {\em simple drawing} of a graph is one where each pair of edges share at most one point: either a common endpoint or a proper crossing. An edge in the complement o…
Extending Simple Drawings
Alan Arroyo, Martin Derka, Irene Parada
Simple drawings of graphs are those in which each pair of edges share at most one point, either a common endpoint or a proper crossing. In this paper we study the problem of extend…
Graphs with at most one crossing
André C. Silva, Alan Arroyo, R. Bruce Richter +1
The crossing number of a graph is the least number of crossings over all possible drawings of . We present a structural characterization of graphs with crossing number one.