Prove that an edge e is contained in every spanning tree for a connected graph G if, and
Chapter 10, Problem 22(choose chapter or problem)
Prove that an edge e is contained in every spanning tree for a connected graph G if, and only if, removal of e disconnects 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