On complexity of mutlidistance graph recognition in ${\mathbb{R}}^1$

Mikhail Tikhomirov

Let $\mathcal{A}$ be a set of positive numbers. A graph $G$ is called an $\mathcal{A}$-embeddable graph in ${\mathbb{R}}^d$ if the vertices of $G$ can be positioned in ${\mathbb{R}}^d$…