What will be the chromatic index for a complete graph having n vertices (consider n to be an odd number)?
(a) n
(b) n + 1
(c) n – 1
(d) 2n + 1
I have been asked this question by my college professor while I was bunking the class.
The above asked question is from Graph Coloring topic in division Graph Coloring of Data Structures & Algorithms II