Given a graph $(V,E)$, I'm interested in embedding it into a Euclidean space $\mathbb{R}^n$ such that each vertex $v\in V$ becomes a point $x_v\in\mathbb{R}^n$ and $d(x_v,x_u) \leq 1$ (Euclidean distance) iff $(v,u) \in E$.
I know that Maxcut isn't NP-hard for planar graphs. But what if I consider graphs that can be embedded as above in $\mathbb{R}^2$, do we know if Maxcut is NP-hard in this case? What about the above embedding in $\mathbb{R}^3$?