TY  - BOOK
AU  - Stiebitz,Michael
TI  - Graph edge coloring: Vizing's theorem and Goldberg's conjecture 
T2  - Wiley series in discrete mathematics and optimization
SN  - 9781118091371
AV  - QA166 G766 2012
PY  - 2012///
CY  - Hoboken, N.J.
PB  - Wiley
KW  - Graph coloring
KW  - Graph theory
N1  - "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
N2  - "This book provides an overview of this development as well as describes how the many different results are related"--
ER  -