d="sp0050">We conjecture that when d="mmlsi1" class="mathmlsrc">data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0095895616300041&_mathId=si1.gif&_user=111111111&_pii=S0095895616300041&_rdoc=1&_issn=00958956&md5=3d70c76065ac7631bdbdf6765432d34f" title="Click to view the MathML source">k=2dden">de">, the disconnectedness of S is crucial: more precisely, that if G is a digraph, and d="mmlsi2" class="mathmlsrc">data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0095895616300041&_mathId=si2.gif&_user=111111111&_pii=S0095895616300041&_rdoc=1&_issn=00958956&md5=1f7caec36caafab5e36e99df6361a5a0" title="Click to view the MathML source">S⊆E(G)dden">de"> forms a connected subdigraph (as an undirected graph), and every directed cut of G contains at least two edges in S, then we can partition S into two dijoins.
d="sp0060">We prove this in two special cases: when G is planar, and when the subdigraph formed by the edges in S is a subdivision of a caterpillar.