05C15, Coloring of graphs and hypergraphs — 1 results found.
C. R. Math. Rep. Acad. Sci. Canada Vol. 41 (1) 2019, pp. 7-19
Jasbir S. Chahal; Omar Khadir (Received: 2019/05/05, Revised: 2019/06/17)

Mathematical Reports - Comptes rendus mathématiques
of the Academy of Science | de l'Académie des sciences
The four color conjecture states that any contiguous geographical entity needs at most four colors to color it properly. Some countries like Canada need actually only three colors whereas for others like Morocco three won’t suffice. Let \(k=k(X)\) be the least number of colors that suffice to color a country \(X\). Someone has yet to compute in how many ways \(X\) can be colored with \(k\) colors, even for a single country \(X\) for which the problem is non-trivial. In this paper, we do it for the two countries Canada and Morocco. We provide all the mathematical tools that are necessary.