ABSTRACT
In the preceding chapter we were introduced to the famous map coloring problem known as the Four Color Problem. We saw that this problem can also be stated as a problem dealing with coloring the vertices of a certain class of graphs called planar graphs or as a problem dealing with coloring the edges of a certain subclass of planar graphs. This gives rise to coloring the vertices or coloring the edges of graphs in general. In order to provide the background needed to discuss this subject, we will describe, over the next five chapters, some of the fundamental concepts and theorems we will encounter in our investigation of graph colorings as well as some common terminology and notation in graph theory.
