Christofides, D., Keevash, P., Kühn, D., & Osthus, D. (2012). Finding Hamilton cycles in robustly expanding digraphs. Journal of Graph Algorithms and Applications, 16(2), 335–358. https://doi.org/10.7155/jgaa.00261