We are given an undirected and unweighted graph.
- We have to determine if the graph contains a cycle that visits every vertex exactly once