Revision as of 14:40, 31 January 2016 edit BD2412 (talk \| contribs) Autopatrolled, Administrators 2,527,835 edits m Graph (mathematics) is now a disambiguation link; please fix., replaced: graph → graph{{dn\|{{subst:DATE}}}} using AWB ← Previous edit		Revision as of 20:01, 31 January 2016 edit undo BD2412 (talk \| contribs) Autopatrolled, Administrators 2,527,835 edits m Fixing links to disambiguation pages, replaced: graph{{dn\|date=January 2016}} → graph using AWB Next edit →
Line 1: In [[graph theory]], a '''degree-constrained spanning tree''' is a [[spanning tree (mathematics)\|spanning tree]] where the maximum [[Degree (graph theory)\|vertex degree]] is limited to a certain [[Constant (mathematics)\|constant]] ''k''. The '''degree-constrained spanning tree problem''' is to determine whether a particular [[Graph (discrete mathematics)\|graph]]~~{{dn\|date=January 2016}}~~ has such a spanning tree for a particular ''k''. ==Formal definition==

Degree-constrained spanning tree: Difference between revisions