Problem Input: An undirected graph G = (V, E) Output: A spanning tree of G in which each node has degree ≤