Complexity of Multiple-Hamiltonicity in Graphs of Bounded Degree

Brian Liu, Nathan S. Sheffield, Alek Westover

We study the following generalization of the Hamiltonian cycle problem: Given integers $a,b$ and graph $G$, does there exist a closed walk in $G$ that visits every vertex at least…