Revision as of 08:18, 27 November 2005 edit Dcoetzee (talk \| contribs) 37,529 edits For k=2, is Hamiltonian path problem ← Previous edit		Revision as of 21:13, 15 December 2005 edit undo 70.171.15.87 (talk) →References Next edit →
Line 14: [[Category:Spanning tree]] If you have defined that the degree must be <= k, the k=1 case of degree-confined spanning tree is the Hamiltonian path problem (not k=2).

Degree-constrained spanning tree: Difference between revisions