ABSTRACT
In this chapter, we will discuss several interrelated problems on coloring, packing, and coverings of graphs. Strictly speaking, Ramsey problems can also be viewed as coloring problems. The coloring problems in this chapter concern the chromatic number of a graph.
