Show that K6 contains three spanning trees T1, T2 and T3 such that {E(T1),E(T2),E(T3)}
Chapter 13, Problem 4(choose chapter or problem)
Show that K6 contains three spanning trees T1, T2 and T3 such that {E(T1),E(T2),E(T3)} is a partition of E(K6) and the degrees of the vertices of each tree are 3, 3, 1, 1, 1, 1.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer