Chromatic Graph Theory / Edition 1

by Gary Chartrand, Ping Zhang

Overview

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

Product Details

ISBN-13:	9781138343863
Publisher:	Taylor & Francis
Publication date:	11/26/2019
Series:	Textbooks in Mathematics
Pages:	525
Product dimensions:	6.12(w) x 9.19(h) x (d)

About the Author

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.

Table of Contents

The Origin of Graph Colorings

Introduction to Graphs

Trees and Connectivity

Eulerian and Hamiltonian Graphs

Matchings and Factorization

Graph Embeddings

Introduction to Vertex Colorings

Bounds for the Chromatic Number

Coloring Graphs on Surfaces

Restricted Vertex Colorings

Edge Colorings

Ramsey Theory

Monochromatic Ramsey Theory

Color Connection

Distance and Colorings

Domination and Colorings

Induced Colorings

The Four Color Theorem Revisited

What People are Saying About This

From the Publisher

… The book is written in a student-friendly style with carefully explained proofs and examples and contains many exercises of varying difficulty. … The book is intended for standard courses in graph theory, reading courses and seminars on graph colourings, and as a reference book for individuals interested in graphs colourings.
—Zentralblatt MATH 1169

… well-conceived and well-written book … written in a reader-friendly style, and there is a sufficient number of exercises at the end of each chapter.
—Miklós Bóna, University of Florida, MAA Online, January 2009

Editorial Reviews

… The book is written in a student-friendly style with carefully explained proofs and examples and contains many exercises of varying difficulty. … The book is intended for standard courses in graph theory, reading courses and seminars on graph colourings, and as a reference book for individuals interested in graphs colourings.
—Zentralblatt MATH 1169

… well-conceived and well-written book … written in a reader-friendly style, and there is a sufficient number of exercises at the end of each chapter.
—Miklós Bóna, University of Florida, MAA Online, January 2009

… The book is written in a student-friendly style with carefully explained proofs and examples and contains many exercises of varying difficulty. … The book is intended for standard courses in graph theory, reading courses and seminars on graph colourings, and as a reference book for individuals interested in graphs colourings.
—Zentralblatt MATH 1169

… well-conceived and well-written book … written in a reader-friendly style, and there is a sufficient number of exercises at the end of each chapter.
—Miklós Bóna, University of Florida, MAA Online, January 2009

From the Publisher