Revision as of 09:15, 24 February 2006 edit Ligulembot (talk \| contribs) 11,449 edits migrate {{book reference}} to {{cite book}} using AWB ← Previous edit		Revision as of 05:59, 14 June 2006 edit undo Yiyu Shi (talk \| contribs) 1 edit →References Next edit →
Line 15: [[Category:Spanning tree]] If you have defined that the degree must be <= k, the k=12 case of degree-confined spanning tree is the Hamiltonian path problem ~~(not k=2)~~.

Degree-constrained spanning tree: Difference between revisions