Complexity of Multiple-Hamiltonicity in Graphs of Bounded Degree
B Liu, NS Sheffield, A Westover - arXiv preprint arXiv:2405.16270, 2024 - arxiv.org
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 …
b $ and graph $ G $, does there exist a closed walk in $ G $ that visits every vertex at least …