With Chromatic Graph Theory, Second Edition, the authors present 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. Readers will see that the authors accomplished the primary goal of this textbook, which is to introduce graph theory with a coloring theme and to look at graph colorings in various ways.
The textbook also 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.
Features of the Second Edition:
- The book can be used for a first course in graph theory as well as a graduate course
- The primary topic in the book is graph coloring
- The book begins with an introduction to graph theory so assumes no previous course
- The authors are the most widely-published team on graph theory
- Many new examples and exercises enhance the new edition
Table of Contents
The Origin of Graph Colorings
Introduction to Graphs
Trees and Connectivity
Eulerian and Hamiltonian Graphs
Matchings and Factorization
Introduction to Vertex Colorings
Bounds for the Chromatic Number
Coloring Graphs on Surfaces
Restricted Vertex Colorings
Monochromatic Ramsey Theory
Distance and Colorings
Domination and Colorings
The Four Color Theorem Revisited
Gary Chartrand is a professor emeritus of mathematics at Western Michigan University.
Ping Zhang is a professor of mathematics at Western Michigan University.
The two have authored or co-authored many textbooks in mathematics and numerous research articles in graph theory. The authors publish several books on graph theory, including the best-selling Graphs and Diagraphs, Sixth Edition, CRC Press, the most widely-used introductory text for course in graph theory.