The field of graph colouring is an area of discrete mathematics which gives operation research scientists the ability to classify components of a set within given constraints which are generated as a graph. By identifying more than 200 unsolved problems, this text shows a central aspect of discrete mathematics in a new perspective and creates challenges for its readers. Information is also provided on related results and the reference literature.

Features recent advances and new applications in graph edge coloring

Reviewing recent advances in the Edge Coloring Problem, Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture provides an overview of the current state of the science, explaining the interconnections among the results obtained from important graph theory studies. The authors introduce many new improved proofs of known results to identify and point to possible solutions for open problems in edge coloring.

The book begins with an introduction to graph theory and the concept of edge coloring....