Paired many-to-many 2-disjoint path cover of Johnson graphs

Jinhao Liu, Huazhong Lü

Given two 2 disjoint vertex-sets $S=\{u,x\}$ and $T=\{v,y\}$, a paired many-to-many 2-disjoint path cover joining S and T, is a set of two vertex-disjoint paths with endpoints $u,v…