CHRISTOFIDES, Demetres; KEEVASH, Peter; KÜHN, Daniela; OSTHUS, Deryk. Finding Hamilton cycles in robustly expanding digraphs. Journal of Graph Algorithms and Applications, [S. l.], v. 16, n. 2, p. 335–358, 2012. DOI: 10.7155/jgaa.00261. Disponível em: https://jgaa-v4.cs.brown.edu/index.php/jgaa/article/view/paper261. Acesso em: 13 jun. 2025.