Abstract by Thomas Fackrell
Coloring Geographic Maps - Part 2
The number (N) of different ways to color a cartographical map with t colors is within the realm of computational possibility. Finding the chromatic polynomial (which, when evaluated at t, gives N) for a graph with computational software can require an inordinate amount of time. To solve this problem, we use the Chromatic Reduction Theorems to reduce full graphs to smaller sub-graphs, and then use computation software to compute and combine the results to solve the larger problem. Our results include the number of ways to color the map of the lower 48 States of the US with 4 colors.
In this three part presentaion, my part is to explain the details of the computations.