In graph G finding a cycle with no duplicate vertices of length at least k is NP complete.

322 Views Asked by At

I know that this problem is similar to the hamming cycle problem, But how can I show that the hamming cycle problem reduces to this problem in a polynomial number of steps?

1

There are 1 best solutions below

3
On
  1. You mean the Hamilton cycle problem.

  2. To reduce the Hamilton cycle problem to this problem, simply set $k$ to the number of vertices in the graph.