Question 12
There are 13 regions in the diagram on the right. Each
region is to be painted with one colour. What is the least
number of colours needed to paint all the regions so that
any two adjacent regions do not share the same colour?
Ay 3
B.4
C5
k D. 6
/ E. None of the above
region is to be painted with one colour. What is the least
number of colours needed to paint all the regions so that
any two adjacent regions do not share the same colour?
Ay 3
B.4
C5
k D. 6
/ E. None of the above