Fast regocnition of planar non unit distance graphs

Abstract

We study criteria attesting that a given graph can not be embedded in the plane so that neighboring vertices are at unit distance apart and the straight line edges do not cross.