Graph edge coloring Vizing's theorem and Goldberg's conjecture /
"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 uppe...
Збережено в:
| Співавтор: | |
|---|---|
| Інші автори: | |
| Формат: | Електронний ресурс eКнига |
| Мова: | Англійська |
| Опубліковано: |
Hoboken, N.J. :
Wiley,
2012.
|
| Серія: | Wiley series in discrete mathematics and optimization.
|
| Предмети: | |
| Онлайн доступ: | An electronic book accessible through the World Wide Web; click to view |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Резюме: | "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"-- |
|---|---|
| Фізичний опис: | xiv, 321 p. : ill. |
| Бібліографія: | Includes bibliographical references and indexes. |