Which of the following is an NP complete problem?
(a) Hamiltonian cycle
(b) Travelling salesman problem
(c) Calculating chromatic number of graph
(d) Finding maximum element in an array
I have been asked this question in an international level competition.
My doubt is from Graph Coloring topic in portion Graph Coloring of Data Structures & Algorithms II