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 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…