# Graph containing bridge

An edge $e$ is a bridge in a connected graph $G$ if the graph $G-e$, which is obtained from $G$ by removing $e$, is not connected. Show that each graph which has a bridge contains at least two vertices with odd degree.

• Your choice of words is unusual. Does "link" mean "edge"? Does "related" mean "connected"? – Sammy Black May 15 '14 at 19:56
• Well, after the edit, my comment seems strange. :-) – Sammy Black May 15 '14 at 19:56
• I just hope pounds mean vertices! – Casteels May 15 '14 at 19:57