Map coloring problem asks whether the countries on every map can be coloured by using as few colors as possible, in such a way that countries sharing an edge have different colours. We can achieve this problem by representing map as a graph.
In this repository you can find theoretical analysis of some graph colouring algorithm and algorithm it's self.
File analiza_pewnego_algorytmu_kolorujacego_grafy.pdf. First section is introduction to graph theory and graph colouring problem. Next section presents some easy graph colouring algorithm step by step. And the last section is about algorithm presented in paper M. H. Williams, (1985). \emph{A Linear Algorithm for Colouring Planar Graphs with Five Colours}, The Computer Journal 28.1: 78-81.
The algorithm: five_colouring_algm.py. Some test on graphs consist of vertices of degree more than 4: icosahedral.py.
