The question posed by this graph problem, effectively, is: if a player begins with n seeds, what is the maximum number of turns she can take before the game can end? The answer is TREE (n). TREE ...

P. C. Pop, A survey of different integer programming formulations of the generalized minimum spanning tree problem, Carpathian Journal of Mathematics, Vol. 25, No. 1 (2009), pp. 104-118 ...