prove that an edge e of a connected graph is a bridge if and only if (<=>) e bel

Question

prove that an edge e of a connected graph is a bridge if and only if (<=>) e belongs to every spanning tree of G.

This is what I got so far.
=> Assume an edge e of a connected graph is a bridge. Let G be connected and with every e being a bridge then G is a tree. G is then a spanning tree.

This is where I am lost. I am not sure how to show e belongs to every spanning tree of G and then the other end of the proof.

I just may be making this harder than it seems. I am still a little confused on spanning trees.

Help would be great.

Explanation / Answer

(

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.