Two-sets cut-uncut on planar graphs

Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin +2

We study the following Two-Sets Cut-Uncut problem on planar graphs. Therein, one is given an undirected planar graph $G$ and two sets of vertices $S$ and $T$. The question is, what…