TY  - BOOK
AU  - Stiebitz,Michael
ED  - ebrary, Inc.
TI  - Graph edge coloring: Vizing's theorem and Goldberg's conjecture 
T2  - Wiley series in discrete mathematics and optimization
AV  - QA166.247 .G73 2012eb
U1  - 511/.56 23
PY  - 2012///
CY  - Hoboken, N.J.
PB  - Wiley
KW  - Graph coloring
KW  - Graph theory
KW  - Electronic books
KW  - local
N1  - Includes bibliographical references and indexes; Electronic reproduction; Palo Alto, Calif.; ebrary; 2013; Available via World Wide Web; Access may be limited to ebrary affiliated libraries
N2  - "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"--
UR  - http://site.ebrary.com/lib/daystar/Doc?id=10540916
ER  -