# Question: let g v e be a graph an edge...

###### Question details

Let G = (V, E) be a graph. An edge e ∈ E is called a bridge if the graph G0 = (V, E \ {e}) has more connected components than G. Prove or disprove: A graph in which all vertices have even degrees does not contain a bridge.