Key points are not available for this paper at this time.
Abstract Let be a simple graph and let be two integers with . We prove that for every if and only if has a ‐factor, where denotes the number of isolated vertices of and is a special family of trees. Furthermore, we characterize the trees in in terms of their bipartition.
Isaak H. Wolf (Mon,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: