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.

9 pages, 1 table, 5 figures

References in corpus (2)

• Minimal Polynomials for the Coordinates of the Harborth Graph
• 3-regular matchstick graphs with given girth

Cited by in corpus (1)

• A lower bound for 4-regular planar unit distance graphs