Question

The number of colors used by a proper coloring graph is called?

(a) k coloring graph

(b) x coloring graph

(c) m coloring graph

(d) n coloring graph

The question was posed to me at a job interview.

My question comes from Graph Coloring in chapter Graph Coloring of Data Structures & Algorithms II

Answer 1

Correct answer is (a) k coloring graph

To explain: A proper graph ensures that two vertices which share a common edge should not have the same color. If it uses k colors in the process then it is called k coloring of graph.