01565cam a22002174a 4500008004100000020001800041020001500059040000800074050002100082245010400103260003500207300001900242490005800261500080500319505001701124518001501141520012301156650002001279650001801299700003001317111018s2012    njua     b    001 0 eng    a9781118091371  a111809137X  aSDU00aQA166bG766 201200aGraph edge coloring :bVizing's theorem and Goldberg's conjecture /cMichael Stiebitz ... [et al.].  aHoboken, N.J. :bWiley,c2012.  a321 p. :bill.1 aWiley series in discrete mathematics and optimization  a"Written by world authorities on graph theory, this book features many new advances and applications in graph edge coloring, describes how the results are interconnected, and provides historial context throughout. Chapter coverage includes an introduction to coloring preliminaries and lower and upper bounds; the Vizing fan; the Kierstead path; simple graphs and line graphs of multigraphs; the Tashkinov tree; Goldberg's conjecture; extreme graphs; generalized edge coloring; and open problems. It serves as a reference for researchers interested in discrete mathematics, graph theory, operations research, theoretical computer science, and combinatorial optimization, as well as a graduate-level course book for students of mathematics, optimization, and computer science"-- Provided by publisher.  aHKBU library  aYT2025 M10  a"This book provides an overview of this development as well as describes how the many different results are related"-- 0aGraph coloring. 0aGraph theory.1 aStiebitz, Michael,d1954-