A directed graph $D$ is strongly connected if and only if $\forall$ $u,v$ there exists a directed path from $u$ to $v$. Prove that for an undirected graph $G$ the following two are equivalent :
$G$ is 2-edge-connected.
$G$ can be oriented such that the resulting directed graph is strongly-connected.
Posted: Jun 17 '12
Seen: 31 times
Last updated: Jun 17 '12
