+1 vote
80 views

A vertex colouring of a graph $G=(V, E)$ with $k$ coulours is a mapping $c: V \rightarrow \{1, \dots , k\}$ such that $c(u) \neq c(v)$ for every $(u, v) \in E$. Consider the following statements:

1. If every vertex in $G$ has degree at most $d$ then $G$ admits a vertex coulouring using $d+1$ colours.
2. Every cycle admits a vertex colouring using 2 colours
3. Every tree admits a vertex colouring using 2 colours

Which of the above statements is/are TRUE? Choose from the following options:

1. only i
2. only i and ii
3. only i and iii
4. only ii and iii
5. i, ii, and iii

i is true, since in worst case the graph can be complete. So, d+1 colours are necessary for graph containing vertices with degree atmost 'd' .

ii is false since cyles with odd no of vertices require 3 colours.

iii is true, since each level of the tree must be coloured in an alternate fashion. We can do this with two colours.

Therefore, option c is correct.
selected by