ABSTRACT
Coloring problems arise in many contexts. The committee-scheduling example in Chapter 1 has other settings: Assume that G is the graph with the set of courses given in a university as a vertex set. We join an edge between two courses if some students take both courses. The chromatic number is the minimum number of time periods needed to schedule examinations without conflicts. The problem of 4-coloring the regions of maps such that regions with common boundaries receive different colors is another example.
