Abstract:A graph G is a (Euclidean) unit disk graph if it is the intersection graph of unit disks in the Euclidean plane R 2 . Recognizing them is known to be ∃R-complete, i.e., as hard as solving a system of polynomial inequalities. In this note we describe a simple framework to translate ∃R-hardness reductions from the Euclidean plane R 2 to the hyperbolic plane H 2 . We apply our framework to prove that the recognition of unit disk graphs in the hyperbolic plane is also ∃R-complete.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.