Here a signed graph is one where each edge is signed either odd or even. A cycle is odd or even according to the product of the signs of its edges. For a given signed graph, a resigning may be performed by flipping the signs of all edges in the cutset of some vertex subset. Clearly this does not change the sign of any cycle. All possible resignings form an equivalence class. A contraction may only be performed on an even edge (but an odd edge may be changed to even using any appropriate resigning and then a contraction may be performed along that edge).