Perfect partition of some regular bipartite graphs

Chi-Kwong Li, Jeff Soosiah, Gexin Yu

A graph has a perfect partition if all its perfect matchings can be partitioned so that each part is a 1-factorization of the graph. Let $L_{rm,r}=K_{rm,rm}-m{K}_{r,r}$. We first gi…