Andrea Francke Michael Hoffmann The Euclidean degree-4 minimum spanning tree problem is NP-hard. 179-188 2009 Symposium on Computational Geometry http://doi.acm.org/10.1145/1542362.1542399 conf/compgeom/2009 db/conf/compgeom/compgeom2009.html#FranckeH09