Wang's arbitrary cycle-factor conjecture for graphs

Let $G$ be a graph of order $n$, and let $W\subseteq V(G)$ be a vertex set. For a positive integer $k$, an arbitrary $W$-cycle-factor is a collection of $k$ disjoint cycles $C_1,\ldots,C_k$ satisfying $|V(C_i)\cap W|=n_i$ for a prescribed partition $|W|=n_1+\cdots+n_k$, with each $n_i\geq 3$.

Wang's conjecture. If $|W|\geq 3k$ and $\delta(W)\geq 2n/3$, then $G$ contains an arbitrary $W$-cycle-factor.

This conjecture generalizes the arbitrary 2-factor theorem of Aigner and Brandt to a specified vertex set. Its status is not established in the source.