ABSTRACT
There is little doubt that the best known and most studied area within graph theory is coloring.
Graph coloring is arguably the most popular subject in graph theory.
Noga Alon (1993)
The remainder of this book is devoted to this important subject. Dividing a given set into subsets is a fundamental procedure in mathematics. Often the subsets are required to satisfy some prescribed property – but not always. When the set is associated with a graph in some manner, then we are dealing with graph colorings. With its origins embedded in attempts to solve the famous Four Color Problem (see Chapter 0), graph colorings has become a subject of great interest, largely because of its diverse theoretical results, its unsolved problems, and its numerous applications.
