Finding Hamilton cycles in sparse random graphs

Finding hidden Hamiltonian cycles

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing

Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity

Combinatorics, Probability and Computing

The Gn,mphase transition is not hard for the Hamiltonian cycle problem

Journal of Artificial Intelligence Research

Hamilton cycles in 3-out

Random Structures & Algorithms

An effective algorithm for and phase transitions of the directed hamiltonian cycle problem

Journal of Artificial Intelligence Research

A SAT based effective algorithm for the directed hamiltonian cycle problem

CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications