G is called a super restricted edge connected graph if every minimum restricted edge cut separates exactly one edge.

An edge of a 6 connected graph is said to be 6-contractible if its contraction results still in a 6 connected graph.

In the cycle packing problem, given an undirected connected graph g, it is required to find the maximum number of pairwise edge disjoint cycles in g.