How many unique colors will be required for proper vertex coloring of a complete graph having n vertices?
(a) 0
(b) 1
(c) n
(d) n!
I had been asked this question in class test.
This intriguing question comes from Graph Coloring topic in division Graph Coloring of Data Structures & Algorithms II