cut-edges, cycles, and a 2 connected graph

204 Views Asked by At

Read this statement in a textbook:

If G - e - f is disconnected, then f is a cut-edge in G-e, whence f belongs to no edges in G-e, and thus every cycle in G containing f must contain also e.

How can this be true? If f is a cut-edge in G-e, how can f belong to no edges in G-e? Why would every cycle in G containing f must also contain e

1

There are 1 best solutions below

7
On BEST ANSWER

My guess is that it meant to say $f$ belongs to no cycles in $G-e$.