A probability problem by অস্পষ্ট দর্শনানুসারি
Probability
Level
1
What is the least number of colour to colour the following map so that adjacent part are not of same colour?
The answer is 3.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
Use the Welsh and Powell Algorithm...................