Calculating the chromatic index of a graph is a ______________
(a) P problem
(b) NP hard problem
(c) NP complete problem
(d) Cannot be identified as any of the given problem types
I had been asked this question during an internship interview.
The query is from Graph Coloring in portion Graph Coloring of Data Structures & Algorithms II