Dynamic Programming 17

11The minimum number of colours required to colour the vertices of a cycle with n nodes in such a way that no two adjacent nodes have the same colour is

Option : D
Explanation :
3-color if odd length cycle.
2-color if even length cycle

Forgot your password?

I agree with the Terms.