Minimally (k, k)-edge-connected graphs

For an integer l>1, the l-edge-connectivity of a connected graph with at least l vertices is the smallest number of edges whose removal results in a graph with l components. A connected graph G is ...