Abstract
In this paper, we first reduce the problem of finding a minimum parity (g,f)-factor of a graph G into the problem of finding a minimum perfect matching in a weighted simple graph G*. Using the structure of G*, a necessary and sufficient condition for the existence of an even factor is derived.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have