Problem Definition Given a unweighted and undirected graph G=(V,E). Is there a cycle in G that visits each node exactly once?