1 research outputs found
Perfect partition of some regular bipartite graphs
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 . We first give a formula to count the number of perfect
matchings of , then show that and have perfect
partitions.Comment: 11 pages, 1 figur