edited by
12,554 views
37 votes
37 votes

The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same color, is

  1. $2$
  2. $3$
  3. $4$
  4. $5$
edited by

7 Answers

–1 votes
–1 votes
Since the graph is planar graph it is 4 colorable.
–5 votes
–5 votes
The max degree of the vertex is 4 so we need atleast 5 colours to colour the graph
Answer:

Related questions

38 votes
38 votes
4 answers
2
Kathleen asked Sep 18, 2014
8,310 views
The following finite state machine accepts all those binary strings in which the number of $1$’s and $0$’s are respectively: divisible by $3$ and $2$odd and evene...
27 votes
27 votes
5 answers
3
Kathleen asked Sep 18, 2014
18,977 views
Let $A = 1111 1010$ and $B = 0000 1010$ be two $8-bit$ $2’s$ complement numbers. Their product in $2’s$ complement is$1100 0100$$1001 1100$$1010 0101$$1101 0101$