Partition of a Subset into Two Directed Cycles with Partial Degrees

Hong Wang

Let $D=(V,A)$ be a directed graph of order $n\ge 6$. Let $W$ be a subset of $V$ with $|W|\ge 6$. Suppose that every vertex of $W$ has degree at least $(3n-3)/2$ in $D$. Then for…