| 000 | 01663cam a22002534a 4500 | ||
|---|---|---|---|
| 008 | 111018s2012 njua b 001 0 eng | ||
| 020 | _a9781118091371 | ||
| 020 | _a111809137X | ||
| 040 | _aSDU | ||
| 050 | 0 | 0 |
_aQA166 _bG766 2012 |
| 245 | 0 | 0 |
_aGraph edge coloring : _bVizing's theorem and Goldberg's conjecture / _cMichael Stiebitz ... [et al.]. |
| 260 |
_aHoboken, N.J. : _bWiley, _c2012. |
||
| 300 |
_a321 p. : _bill. |
||
| 490 | 1 | _aWiley series in discrete mathematics and optimization | |
| 500 | _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. | ||
| 505 | _aHKBU library | ||
| 518 | _aYT2025 M10 | ||
| 520 | _a"This book provides an overview of this development as well as describes how the many different results are related"-- | ||
| 650 | 0 |
_aGraph coloring. _9203148 |
|
| 650 | 0 | _aGraph theory. | |
| 700 | 1 |
_aStiebitz, Michael, _d1954- _9203149 |
|
| 900 | _a= C.1 SDU | ||
| 942 |
_cGBE _2lcc |
||
| 999 |
_c106738 _d106738 |
||