IAE Academy

GATE 2018 CS Q.18: solution and answer

GATE 2018 · CSQ.18 · 1 mark · NAT

The chromatic number of the following graph is ________.

GATE 2018 CS question 18: An undirected graph on six vertices a, b, c, d, e, f.Tap to open full size
Figure from the GATE 2018 CS paper. It is part of the question.
Figure description

An undirected graph on six vertices a, b, c, d, e, f. Layout: a top-left, e top-right, c and d in the middle (c left of centre, d right of centre), b bottom-left, f bottom-right. Ten edges: a-e, a-c, a-b, e-c, e-f, c-d, c-b, d-b, d-f, b-f.

Answer and solution

ANSWER

The chromatic number of the graph is 3.

Official answer: 3Source: Official answer key, GATE 2018 CS (IIT Guwahati)

  1. Read the edges from the figure: .

  2. Lower bound: are pairwise adjacent (edges , , ), so they form a triangle and .

  3. Try a 3-colouring with colours 1, 2, 3. Colour the triangle: .

  4. Vertex is adjacent to and , so works.

  5. Vertex is adjacent to and , so works.

  6. Vertex is adjacent to , and , so works.

  7. Check every edge: , , , , , , , , , . All end colours differ.

  8. So 3 colours suffice, and the triangle shows fewer will not do: .

KEY IDEA

A triangle forces at least 3 colours. Then give an explicit proper 3-colouring and check every edge to show 3 is enough.

WATCH OUT FOR

Answering 4 because the graph looks dense, without trying to colour it, or answering 2 because the graph looks like it could be bipartite. The triangle rules out 2 colours.

From the GATE 2018 CS paper. Every question of this paper · Download the full paper · All 14 Graph theory questions, with notes

More Graph theory questions