Paired $(n-1)$-to-$(n-1)$ disjoint path covers in bipartite transposition-like graphs

Anna Coleman, Gabrielle Fischberg, Charles Gong +2

A paired $k$-to-$k$ disjoint path cover of a graph $G$ is a collection of pairwise disjoint path subgraphs $P_1,P_2,\dots ,P_k$ such that each $P_i$ has prescribed vertices $s_i$ a…