01663cam a22002534a 4500 111018s2012 njua b 001 0 eng 9781118091371 111809137X SDU QA166 G766 2012 Graph edge coloring : Vizing's theorem and Goldberg's conjecture / Michael Stiebitz ... [et al.]. Hoboken, N.J. : Wiley, 2012. 321 p. : ill. Wiley series in discrete mathematics and optimization "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. HKBU library YT2025 M10 "This book provides an overview of this development as well as describes how the many different results are related"-- Graph coloring. 203148 Graph theory. Stiebitz, Michael, 1954- 203149 = C.1 SDU GBE lcc 106738 106738 0 0 lcc 0 QA0166 G766 02012 0 CGB 284075 SDU SDU GEN3 2025-10-07 2 0 QA166 G766 2012 1000385169 2025-10-07 00:00:00 C.1 2025-10-07 GBE