Christofides, D. et al. 2012. Finding Hamilton cycles in robustly expanding digraphs. Journal of Graph Algorithms and Applications. 16, 2 (Jan. 2012), 335–358. DOI:https://doi.org/10.7155/jgaa.00261.