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

## Answer

**Answers can only be viewed under the following conditions:**

- The questioner was satisfied with and accepted the answer, or
- The answer was evaluated as being 100% correct by the judge.

Alessandro Iraci

1.7K

The answer is accepted.

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

- answered
- 339 views
- $4.00

### Related Questions

- Graph Theory Question
- Determine the Closed Form of a Recurrance Relation
- 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.
- Clock Problem

Is the graph directed or undirected?