Upon the removal of the edges of a 1-factor from an even circuit in a 2-connected graph Original Research Article

Let G be a 2-connected graph with minimum degree at least 3. We prove that there exists an even circuit C in G with factorization F={F1,F2} such that G−E(F1) is 2-connected.