engineering recuitment NIC NIELIT Scientist B 2023 Mock Test Algorithms Algorithm Design Techniques Greedy Algorithms
The minimum number of colours with which we can guarantee that no two adjacent nodes will have the same colour if we want to colour the node of any cycle are:
1
2
2
3
3
4
4
n+2