AI Search
Graph edge coloring : Vizing's theorem and Goldberg's conjecture / Michael Stiebitz ... [et al.].
Material type:
TextSeries: Publication details: Hoboken, N.J. : Wiley, 2012.Description: 321 p. : illISBN: - 9781118091371
- 111809137X
- QA166 G766 2012
English Books
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
English Books
|
MATRIX Library General Eng/FL.3 | General Books | QA166 G766 2012 (Browse shelf(Opens below)) | C.1 | Available | 1000385169 |
"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"--
There are no comments on this title.