Christofides, Demetres, Peter Keevash, Daniela Kühn, and Deryk Osthus. “Finding Hamilton Cycles in Robustly Expanding Digraphs”. Journal of Graph Algorithms and Applications 16, no. 2 (January 1, 2012): 335–358. Accessed June 13, 2025. https://jgaa-v4.cs.brown.edu/index.php/jgaa/article/view/paper261.