Question

If a graph G is k-colorable and k<n, for any integer n then it is ___________

(a) n-colorable

(b) n^2 nodes

(c) (k+n)-colorable

(d) (k^3+n^3+1) nodes

I had been asked this question in an interview.

I want to ask this question from Planarity, Degree and Coloring of Graph in section Graphs of Discrete Mathematics

Answer 1

Correct choice is (a) n-colorable

The explanation is: The chromatic number of a graph is the minimal number of colors for which a graph coloring is possible. A graph G is termed as k-colorable if there exists a graph coloring on G with k colors. If a graph is k-colorable, then it is n-colorable for any n>k.