Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture

Reviewing recent advances in the Edge Coloring Problem, GraphEdge Coloring: Vizing's Theorem and Goldberg's Conjectureprovides an overview of the current state of the science, explaining the interconnections among the results obtained fromimportant graph theory studies. The authors introduce many newimproved proofs of known results to identify and point to possiblesolutions for open problems in edge coloring.

The book begins with an introduction to graph theory and theconcept of edge coloring. Subsequent chapters explore importanttopics such as:

• Use of Tashkinov trees to obtain an asymptotic positive solutionto Goldberg's conjecture

• Application of Vizing fans to obtain both known and newresults

• Kierstead paths as an alternative to Vizing fans

• Classification problem of simple graphs

• Generalized edge coloring in which a color may appear more thanonce at a vertex

This book also features first-time English translations of twogroundbreaking papers written by Vadim Vizing on an estimate of thechromatic class of a p-graph and the critical graphs within a givenchromatic class.

Written by leading experts who have reinvigorated research inthe field, Graph Edge Coloring is an excellent book formathematics, optimization, and computer science courses at thegraduate level. The book also serves as a valuable reference forresearchers interested in discrete mathematics, graph theory, operations research, theoretical computer science, andcombinatorial optimization.