Question

What will be the chromatic index of the following graph?

(a) 0

(b) 1

(c) 2

(d) 3

I got this question by my college professor while I was bunking the class.

I'd like to ask this question from Graph Coloring in division Graph Coloring of Data Structures & Algorithms II

Answer 1

Right option is (c) 2

To explain: The given graph will require 2 unique colors so that no two incident edges have the same color. So its chromatic index will be 2.