3 citations · 5 across the 5 of their papers we have counts for
1 paper · 2 filters
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…