# Prove that in 2-edge-connected graph, each vertex lies on a cycle.

## 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.

Alessandro Iraci

1.6K

The answer is accepted.

Join Matchmaticians Affiliate Marketing
Program to earn up to 50% commission on every question your affiliated users ask or answer.

- answered
- 277 views
- $4.00

### Related Questions

- Determine the Closed Form of a Recurrance Relation
- Clock Problem
- Characterizing the Infinitely Visited Intersections in a Ride-Forever Path on a Directed Graph
- Discrete Math Question
- Determine the number of perfect pairings in a complete bipartite graph Kn,n, in which n disjoint edges are removed.
- Graph Theory Question

Is the graph directed or undirected?