Mr Euler had a formula. And it works!
fantastic booklet. We still have a bit more to do on this. On the first pages the idea is to find the minimum number of colours to colour the "graph" so that no connected vertices are the same colour, like this:
Here's some of our work in the booklet: