Prove that in 2-edge-connected graph, each vertex lies on a cycle.
Prove that in 2-edge-connected graph, each vertex lies on some cycle.
-
Is the graph directed or undirected?
Answer
Answers can be viewed only if
- The questioner was satisfied and accepted the answer, or
- The answer was disputed, but the judge evaluated it as 100% correct.
The answer is accepted.