LBST Decision Problem

• Input: An undirected graph G = (V,E) and number k.

• Output: Determine if G has a spanning tree of degree k.

• We expect a yes/no answer only without reporting a solution if the answer is yes.

Previous slide

Next slide

Back to first slide

View graphic version