- given a graph G, find a cycle that visits each vertex exactly once, or report that no cycle exists