Get the latest tech news
Graph Coloring Methods
Daniel W. Cranston This is a graduate textbook about how to color graphs. Each chapter studies a single method, and presents numerous examples applying that method, generally in order of increasing difficulty.
This is a graduate textbook about how to color graphs.  Each chapter studies a single method, and presents numerous examples applying that method, generally in order of increasing difficulty. The book is designed to be suitable for a topics course in graph coloring, as well as self-study. Greedy Coloring Gadgets: Constructions for Lower Bounds Recoloring Vertex Identification: Coloring Planar Graphs The Kernel Method Deletion and Contraction: Nowhere-Zero Flows Rosenfeld Counting The Combinatorial Nullstellensatz The Activation Strategy The Vertex Shuffle Precoloring Extension The Potential Method The Rest of the Story
Or read this on Hacker News