Key points are not available for this paper at this time.
We address the last outstanding case of the directed Oberwolfach problem with two tables of different lengths. Specifically, we show that the complete symmetric directed graph K^*ₙ admits a decomposition into spanning subdigraphs comprised of two vertex-disjoint directed cycles of length t₁ and t₂, respectively, where t₁ \4, 6\, t₂ is even, and t₁+t₂ 14. In conjunction with recent results of Kadri and Sajna, this gives a complete solution to the directed Oberwolfach problem with two tables of different lengths.
Horsley et al. (Mon,) studied this question.