Let k 2 and n 1 be integers, let G be a graph of order n with minimum degree at least k + 1.Let v1, v2, , v k be k distinct vertices of G, and suppose that there existSuppose further that the minimum value of the sum of the degrees of two nonadjacent distinct vertices is greater than or equal to n + k-4 3 .Under these assumptions, we show that there is a 2-factor of G with k cycles D1, D2, , D k such that vi V (Di) for each 1 i k.
Toshinori Sakai (Tue,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: