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, Chromatic Graph Theory explores connections between major topics in graph theory and graph colorings as well as emerging topics.
This self-contained book first presents various fundamentals of graph theory that lie outside of graph colorings, including basic terminology and results, trees and connectivity, Eulerian and Hamiltonian graphs, matchings and factorizations, and graph embeddings. The remainder of the text deals exclusively with graph colorings. It covers vertex colorings and bounds for the chromatic number, vertex colorings of graphs embedded on surfaces, and a variety of restricted vertex colorings. The authors also describe edge colorings, monochromatic and rainbow edge colorings, complete vertex colorings, several distinguishing vertex and edge colorings, and many distance-related vertex colorings.
With historical, applied, and algorithmic discussions, this text offers a solid introduction to one of the most popular areas of graph theory.
Chapman & Hall/CRC
Discrete mathematics, graph coloring, graph theory
Discrete Mathematics and Combinatorics
Chartrand, Gary and Zhang, Ping, "Chromatic Graph Theory" (2009). All Books and Monographs by WMU Authors. 113.