3 citations · 5 across the 5 of their papers we have counts for
1 paper · 2 filters
Mike Winkler, Peter Dinkelacker, Stefan Vogel
A matchstick graph is a planar unit-distance graph. We call it \emph{4-regular} if every vertex has degree 4. While examples of 4-regular matchstick graphs with fewer than 63 verti…