ABSTRACT
The focus in Chapter 8 was on partitioning the vertex set of a graph such that the parts of the partition induce subgraphs with predetermined properties. In this chapter, we are concerned with coloring models that pertain to optimization problems involving partitioning both the vertex and the edge set. We begin with the introduction of the coloring number. It is an upper bound for the usual chromatic number and is related to colorings obtained by greedy algorithms. Then we study L(2,1)-labelings that arise in channel assignment problems in communication networks. The chapter ends with a section on edge colorings.
