7 citations · 9 across the 8 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2019
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…
cs.CG2019
Bounded maximum degree conjecture holds precisely for -crossing-critical graphs with
Drago Bokal, Zdeněk Dvořák, Petr Hliněný +3
We study -crossing-critical graphs, which are the minimal graphs that require at least edge-crossings when drawn in the plane. For every fixed pair of integers with $c\ge 13…