Characterization of minimally (2,l)-connected graphs

For an integer l>=2, the l-connectivity @k"l(G) of a graph G is defined to be the minimum number of vertices of G whose removal produces a disconnected graph with at least l components or a graph with fewer than l vertices. Let k>=1, a graph G is called (k,l)-connected if @k"l(G)>=k. A graph G is called minimally (k,l)-connected if @k"l(G)>=k but @[email protected]?E(G), @k"l(G-e)=