A lower bound for 4-regular planar unit distance graphs

Abstract

We perform an exhaustive search for the minimum 4-regular unit distance graph resulting in a lower bound of 34 vertices.

11 pages, 5 figures

References in corpus (2)

• 3-regular matchstick graphs with given girth
• Fast regocnition of planar non unit distance graphs