3 citations · 5 across the 5 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.CO2016
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…
math.MG2016★ 2 cited
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…