Degree-constrained spanning tree: Difference between revisions

Content deleted Content added
No edit summary
Tags: Mobile edit Mobile app edit iOS app edit
how about we don't italicize numbers within mathematics formulas
Line 3:
==Formal definition==
 
Input: ''n''-node undirected graph G(V,E); positive [[integer]] ''k'' < ''n - 1''.
 
Question: Does G have a spanning tree in which no [[Node (computer science)|node]] has degree greater than ''k''?