Assume a weighted graph G and a positive value k are given.
What is the complexity of finding a cycle with total weight k when G is Hamiltonian or Hamiltonian-connected?
pointing to papers and books is also welcome!
I wish it wouldn’t look as a homework!