Chromatic Graph Theory

Více o knize

The book delves into the evolution of graph colorings, starting from the four color problem of 1852, and highlights its significance in graph theory. It connects major topics like Ramsey numbers and domination with various types of colorings, including list, rainbow, and distance colorings, which relate to practical issues like channel assignment. Additionally, it features historical context, applied examples, and algorithmic insights, complemented by numerous exercises and project suggestions to enhance understanding and engagement with the material.