arXiv · 1604.07134
New minimal (4; n)-regular matchstick graphs
Abstract
A matchstick graph is a graph drawn with straight edges in the plane such that the edges have unit length, and non-adjacent edges do not intersect. We call a matchstick graph ($m;n)$-regular if every vertex has only degree $m$ or $n$. In this article the authors present the latest known $(4;n)$-regular matchstick graphs for $4\leq n\leq11$ with a minimum number of vertices.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Mike Winkler, Peter Dinkelacker, Stefan Vogel. 2018-05-01. New minimal (4; n)-regular matchstick graphs. https://arxiv.org/abs/1604.07134
Cite the original work for its findings. Save a collection to share your selection of sources.