3 citations · 8 across the 14 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.GM2017
Deterministic Structures in the Stopping Time Dynamics of the 3x+1 Problem
Mike Winkler
The problem concerns the iteration of the map defined by for even and for odd . We study the coefficient stoppi…
math.CO2017
A catalog of 4-regular and (2;4)-regular matchstick graphs
Mike Winkler
The first part (page 1 - 7) of this article presents the currently known examples of 4-regular matchstick graphs with 63 - 70 vertices. The second part (page 8 - 15) presents the c…
math.CO2017★ 3 cited
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…