Recognition: unknown
Perfect partition of some regular bipartite graphs
classification
🧮 math.CO
keywords
perfectgraphmatchingspartitionbipartitecountfactorizationfirst
read the original abstract
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}-mK_{r,r}$. We first give a formula to count the number of perfect matchings of $L_{rm, r}$, then show that $L_{6,1}$ and $L_{8,2}$ have perfect partitions.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.