Bart Jansen
Bart Jansen 1. Problem definition Instance: Connected graph G, positive integer k Question: Is there a spanning tree for G with at least k leaves?
