Christofides, Demetres, Peter Keevash, Daniela Kühn, and Deryk Osthus. 2012. “Finding Hamilton Cycles in Robustly Expanding Digraphs”. Journal of Graph Algorithms and Applications 16 (2):335-58. https://doi.org/10.7155/jgaa.00261.