A lower bound for 4-regular planar unit distance graphs
Combinatorics
2014-01-20 v1
Abstract
We perform an exhaustive search for the minimum 4-regular unit distance graph resulting in a lower bound of 34 vertices.
Keywords
Cite
@article{arxiv.1401.4377,
title = {A lower bound for 4-regular planar unit distance graphs},
author = {Sascha Kurz},
journal= {arXiv preprint arXiv:1401.4377},
year = {2014}
}
Comments
11 pages, 5 figures