GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
97 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
asked in Graph Theory by Veteran (77.3k points)   | 97 views

1 Answer

+2 votes
Best answer
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.
answered by Junior (995 points)  
selected by


Top Users May 2017
  1. akash.dinkar12

    3578 Points

  2. pawan kumarln

    2314 Points

  3. Bikram

    1950 Points

  4. Arjun

    1852 Points

  5. sh!va

    1682 Points

  6. Debashish Deka

    1296 Points

  7. Devshree Dubey

    1282 Points

  8. Arunav Khare

    1122 Points

  9. Angkit

    1072 Points

  10. LeenSharma

    1028 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 May 29 - Jun 04
  1. Arunav Khare

    246 Points

  2. Arjun

    202 Points

  3. pawan kumarln

    108 Points

  4. Rupendra Choudhary

    94 Points

  5. Niharika 1

    90 Points


22,909 questions
29,243 answers
65,402 comments
27,744 users