The graph contains a triangle (for example $a$, $b$, $c$), so at least 3 colours are needed, and a proper 3-colouring exists. So the chromatic number is 3.
More Discrete Mathematics: Graphs (Connectivity, Matching, Colouring) questions
GATE 2018 CS Q53– Let G be a graph with 100! vertices, with each vertex labelled by a distinct permutation…
GATE 2015 CS (CS1) Q44– Let G be a connected planar graph with 10 vertices. If the number of edges on each face is…
GATE 2017 CS (CS1) Q30– Let T be a tree with 10 vertices. The sum of the degrees of all the vertices in T is .
GATE 2014 CS (CS1) Q61– An undirected graph without self-loops has vertices \(i,j):1 i12,\ 1 j12\. Distinct…
GATE 2014 CS (CS1) Q62– A nonincreasing n-tuple is graphic if a simple undirected n-vertex graph has those…