Computational Thinking: Graph Colouring

So this activity might just look like simple colouring, but it actually requires some real brain power!

Basically you need to colour each vertex on this graph so that connected vertices have different colours.  Try to use the fewest number of colours.  (This number is called the chromatic number).



Mrs. Klein had a go earlier today but she got in a bit of a pickle. There are four circled mistakes where the connecting vertices are the same colours. 


If you enjoyed this investigation you might like to read up some more on The Four Colour Theorem.