In the example above, the chromatic number was 5, but this is not a counterexample to the Four Color Theorem 4.4.2, since the graph representing the radio stations is not planar. It would be nice to have some quick way to find the chromatic number of a (possibly non-planar) graph. It turns out nobody knows whether an efficient algorithm for computing chromatic numbers exists.
in-context