Algorithms - Algorithm Design Techniques

66. The 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
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *