Preprint
Oct 2026
The Complexity of Hamiltonian Cycles and Paths with Prescribed Walk Lengths
This work proves NP-completeness for every finite nonempty set of odd lengths, resolving an open problem posed by Amarilli, Lombardo, and Monet (WG 2026).
Hitendra Kumar, Mathieu Mari, R. B. Sandeep
· 0 citations