A lower bound for 4-regular planar unit distance graphs

preprint2014arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.