Solution
= Solution
A <Hamilton cycle> is a <cycle graph> which visits every vertex of a finite graph exactly once, apart from returning to its starting vertex. A graph is <Hamiltonian> when it contains such a cycle.
= Solution
A <Hamilton cycle> is a <cycle graph> which visits every vertex of a finite graph exactly once, apart from returning to its starting vertex. A graph is <Hamiltonian> when it contains such a cycle.