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.
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.
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:
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.
This item is eligible for free returns within 30 days of delivery. See our returns policy for further details.