Combinatorics and Graph Theory · Problem 5.7.5

Graph Theory — David Guichard

Mathematics — Combinatorics · connectivity

Problem

Suppose

G

has at least one edge. Show that

G

is 2-connected if and only if for all vertices

v

and edges

e

there is a cycle containing

v

and

e