3 citations · 5 across the 5 of their papers we have counts for
5 papers
A 3-regular matchstick graph of girth 5 consisting of 54 vertices
Mike Winkler, Peter Dinkelacker, Stefan Vogel
In 2010 it was proved that a 3-regular matchstick graph of girth 5 must consist at least of 30 vertices. The smallest known example consisted of 180 vertices. In this article we co…
4-regular planar unit triangle graphs without additional triangles
Mike Winkler, Peter Dinkelacker, Stefan Vogel
In this article we proof the existence of 4-regular planar unit-distance graphs consisting only of unit triangles without additional triangles. It is shown that the smallest number…
On the existence of 4-regular matchstick graphs
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…
Minimal completely asymmetric (4; n)-regular matchstick graphs
Mike Winkler, Peter Dinkelacker, Stefan Vogel
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…
New minimal (4; n)-regular matchstick graphs
Mike Winkler, Peter Dinkelacker, Stefan Vogel
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…