Cargando…
Graph edge coloring : Vizing's theorem and Goldberg's conjecture /
"This book provides an overview of this development as well as describes how the many different results are related"--
| Clasificación: | Libro Electrónico |
|---|---|
| Otros Autores: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Hoboken, NJ :
Wiley,
2012.
|
| Colección: | Wiley series in discrete mathematics and optimization.
|
| Temas: | |
| Acceso en línea: | Texto completo |
| Sumario: | "This book provides an overview of this development as well as describes how the many different results are related"-- |
|---|---|
| Notas: | "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 |
| Descripción Física: | 1 online resource (xiv, 321 pages) : illustrations |
| Bibliografía: | Includes bibliographical references and indexes. |
| ISBN: | 9781118205563 1118205561 1118205596 9781118205594 1280591617 9781280591617 9786613621443 6613621447 |