(a) Show that the 3-regular graph K4 contains two spanning trees T1 and T2 such that
Chapter 13, Problem 21(choose chapter or problem)
(a) Show that the 3-regular graph K4 contains two spanning trees T1 and T2 such that {E(T1),E(T2)} is a partition of E(K4). (b) Give an example of a graph G of order 6 such that every vertex of G has degree 3 or 4 and G contains two spanning trees T1 and T2 for which {E(T1),E(T2)} is a partition of E(G).
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