RAC-drawability is ∃ℝ-complete

07/24/2021
by   Marcus Schaefer, et al.
0

A RAC-drawing of a graph is a straight-line drawing in which every crossing occurs at a right-angle. We show that deciding whether a graph has a RAC-drawing is as hard as the existential theory of the reals, even if we know that every edge is involved in at most ten crossings and even if the drawing is specified up to isomorphism.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset