On computational complexity of length embeddability of graphs

A graph GG is embeddable in RdRd if the vertices of GG can be assigned to points of RdRd in such a way that all pairs of adjacent vertices are at distance 1. We show that verifying embeddability of a given graph in RdRd is NP-hard in the case d>2d>2 for all reasonable notions of embeddability.