Calculate chromatic number

Question

Shiva draws a tree of N nodes, where a node can be adjacent to maximum of 4 other nodes. What is the minimum number of colors Shiva should use so that no two adjacent nodes get the same color?

A. 5

B. 4

C. 3

D. 2

// Please explain how to solve this?

Answer 1

The chromatic number of any tree is 2, unless the graph contains no edges, in which case its chromatic number is trivial.

Let's Take a example for your question

Here clearly We can see graph is 2-colorable.

Hence,option(D)2 .