Packing odd $T$-joins with at most two terminals

Ahmad Abdi, Bertrand Guenin

Take a graph $G$, an edge subset $\Sigma \subseteq E(G)$, and a set of terminals $T\subseteq V(G)$ where $|T|$ is even. The triple $(G,\Sigma ,T)$ is called a signed graft. A $T$-join is odd i…