Undirected Graph

Given a connected graph G, find whether G is 2 Edge connected or not. Another variation: find whether the graph is 2 vertex connected or not?

Def: 2 Edge connected: There is more than one edge between every 2 vertices. Example of the problem is: Network, where we want to verify if one edge is broken, the network should not down (fault tolerance).