Fill-in-the-blank proof for Section 7.2

1. Claim: If G is a simple, connected graph and there is an edge e whose removal results in a connected graph G', then there is a cycle in G.
   Proof. Click here.