Revision as of 20:46, 30 October 2005 edit Ruud Koot (talk \| contribs) 31,416 edits mNo edit summary ← Previous edit		Revision as of 23:30, 1 November 2005 edit undo 128.174.251.29 (talk) No edit summary Next edit →
Line 8: [[Category:Spanning tree]] This problem is NP-Complete. This can be shown by a reduction from the problem of finding a Hamiltonian path.

Degree-constrained spanning tree: Difference between revisions