Question

Minimum number of unique colors required for vertex coloring of a graph is called?

(a) vertex matching

(b) chromatic index

(c) chromatic number

(d) color number

The question was posed to me in final exam.

This is a very interesting question from Graph Coloring topic in division Graph Coloring of Data Structures & Algorithms II

Answer 1

The correct answer is (c) chromatic number

To explain: The minimum number of colors required for proper vertex coloring of graph is called chromatic number whereas the minimum number of colors required for proper edge coloring of graph is called chromatic index of a graph.