Paired $(n-1)$-to-$(n-1)$ disjoint path covers in bipartite
transposition-like graphs
Paired $(n-1)$-to-$(n-1)$ disjoint path covers in bipartite
transposition-like graphs
A paired $k$-to-$k$ disjoint path cover of a graph $G$ is a collection of pairwise disjoint path subgraphs $P_1,P_2,\dotsc,P_k$ such that each $P_i$ has prescribed vertices $s_i$ and $t_i$ as endpoints and the union of $P_1,P_2,\dotsc,P_k$ contains all vertices of $G$. In this paper, we introduce bipartite transposition-like graphs, which …