3 ms·

Is this similar to graph colouring?

• rpigab 3y ago
  They are distinct problems, because if you have a graph with a Hamiltonian cycle inside, you can add as many edges as you want, the cycle will always be there, but some N-colouring solutions might break. They are both NP-complete though.