Chromatic Graph Theory

Beginning with the origin of the four color problem in 1852, the field of graph colorings has developed into one of the most popular areas of graph theory. Introducing graph theory with a coloring theme, this book explores connections between major topics in graph theory and graph colorings, including Ramsey numbers and domination, as well as emerging topics, such as list colorings, rainbow colorings, distance colorings related to the channel assignment problem, and vertex/edge distinguishing colorings. The authors include historical, applied, and algorithmic discussions. They also provide many exercises and suggestions for study projects.