hamiltonian_cycle_multiple (527B)
1 # Hamiltonian cycle multiple 2 3 A generalization of [Hamiltonian_cycle] where you can go over each [vertex] at most k times for some k. 4 - By https://courses.engr.illinois.edu/cs374/fa2016/homework/hw10.pdf this problem is also [NP_complete]. 5 - A [star] with large [degree] is an example of a [graph] having no such generalized [hamiltonian_path] for any k 6 - mentioned here https://cstheory.stackexchange.com/questions/53492/name-for-a-cyclic-path-in-a-graph-that-visits-every-vertex-while-minimizing-the 7 8 Up: [hamiltonian_cycle]