Chromatic Graph Theory

Gary Chartrand, Ping Zhang

September 22, 2008 by Chapman and Hall/CRC
Reference - 504 Pages - 278 B/W Illustrations
ISBN 9781584888000 - CAT# C8008
Series: Discrete Mathematics and Its Applications

was $121.95


SAVE ~$24.39

Add to Wish List
SAVE 25%
When you buy 2 or more print books!
See final price in shopping cart.
FREE Standard Shipping!


  • Presents the fundamentals of graph theory, including trees, Hamiltonian graphs, factorizations, and more
  • Covers key topics in graph theory, such as Ramsey numbers and domination
  • Explores emerging areas in graph coloring, including list colorings, rainbow colorings, distance colorings related to the channel assignment problem, and vertex/edge distinguishing colorings
  • Contains carefully explained proofs and examples, along with many exercises of varying levels of difficulty at the end of each chapter
  • Offers suggestions for study projects in the appendix

Solutions manual available for qualifying instructors


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.