Linkages and removable paths avoiding vertices

Xiying Du, Yanjia Li, Shijie Xie +1

We say that a graph $G$ is $(2,m)$-linked if, for any distinct vertices $a_1,\dots ,a_m,b_1,b_2$ in $G$, there exist vertex disjoint connected subgraphs $A,B$ of $G$ such that $\…