On computational complexity of length embeddability of graphs

Mikhail Tikhomirov

A graph $G$ is embeddable in ${\mathbb{R}}^d$ if vertices of $G$ can be assigned with points of ${\mathbb{R}}^d$ in such a way that all pairs of adjacent vertices are at the distance 1…