ABSTRACT
Graph coloring theory has a central position in discrete mathematics. Graph coloring deals with the fundamental problem of partitioning a set into classes according to certain rules. Timetabling, sequencing, and scheduling problems are basically of this nature and hence graph coloring has interesting applications to several practical problems. Though many deep and interesting results have been obtained on graph coloring during the past 100 years, there are still many easily formulated, interesting, and challenging unsolved problems. In this chapter we present basic results on various graph coloring concepts such as vertex, edge, total, list, complete, and dominator colorings.
