Problem
1. Write an algorithm for the 2-Coloring problem whose time complexity is not worst-case exponential in n.
2. List some of the practical applications that are representable in terms of the coloring problem.
3. Use the Backtracking algorithm for the Hamiltonian Circuits problem (Algorithm 5.6) to find all possible Hamiltonian Circuits of the following graph.
Attachment:- Graph.rar