Problem 3 45 Points Given Undirected Graph G V E Binary Spanning Tree G Span Ning Tree Ve Q37194303

Problem 3 (45 points). Given an undirected graph G = (V,E), a binary spanning tree of G is a span- ning tree where each vertex has degree at most 3. Show that checking if G has a binary spanning tree is NP-complete Hint: You may use the fact that HAMILTOnIan PaTh problem is NP-complete. For a graph G – (V, E), the HAMILTONIAN PATH problem is to determine whether or not there

OR

 

OR