A lower bound for 4-regular planar unit distance graphs
classification
🧮 math.CO
keywords
bounddistancelowerregularunitexhaustivegraphgraphs
read the original abstract
We perform an exhaustive search for the minimum 4-regular unit distance graph resulting in a lower bound of 34 vertices.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.