Edges of degree k in minimally restricted k-edge connected graphs

For a connected graph G=(V,E), an edge set S@?E is a restricted edge cut if G-S is disconnected and there is no isolated vertex in G-S. The cardinality of a minimum restricted edge cut of G is the restricted edge connectivity of G, denoted by @l^'(G). A graph G is called minimally restricted k-edge connected if @l^'(G)=k and @l^'(G-e)4, then there are at least four. Examples show that the lower bounds are best possible.