Here a signed graph is one where each edge is signed either odd or even. A cycle is odd or even according to the sum 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. When taking minors, any edge may be deleted, but only even edges may be contracted (but an odd edge may be changed to even using any appropriate resigning and then a contraction may be performed along that edge). 



Is there a version of Robertson-Seymour's graph minor theorem known to apply to signed graphs?
Yes. This is one of the results of the [Matroid Minors Project](http://www.math.uwaterloo.ca/~jfgeelen/Research/research.html) of Geelen, Gerards and Whittle as part of their proof of [Rota's Conjecture](https://www.wikiwand.com/en/Rota's_conjecture). In fact, they prove that for any finite abelian group $\Gamma$, the class of $\Gamma$-labelled graphs is well-quasi-ordered. Signed graphs correspond to the special case of $\Gamma=\mathbb{Z} / 2 \mathbb{Z}$. I believe this result is still being written up though. However, the generalization of the [Graph Minors Structure Theorem](https://www.wikiwand.com/en/Graph_structure_theorem) (which is a key ingredient of the proof of the Graph Minors Theorem) to group-labelled graphs has already appeared. See this [paper](http://www.math.uwaterloo.ca/~jfgeelen/Publications/pims.pdf) of Geelen and Gerards. 


