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 |
Tabla de Contenidos:
- Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture; CONTENTS; Preface; 1 Introduction; 1.1 Graphs; 1.2 Coloring Preliminaries; 1.3 Critical Graphs; 1.4 Lower Bounds and Elementary Graphs; 1.5 Upper Bounds and Coloring Algorithms; 1.6 Notes; 2 Vizing Fans; 2.1 The Fan Equation and the Classical Bounds; 2.2 Adjacency Lemmas; 2.3 The Second Fan Equation; 2.4 The Double Fan; 2.5 The Fan Number; 2.6 Notes; 3 Kierstead Paths; 3.1 Kierstead's Method; 3.2 Short Kierstead's Paths; 3.3 Notes; 4 Simple Graphs and Line Graphs; 4.1 Class One and Class Two Graphs
- 4.2 Graphs whose Core has Maximum Degree Two4.3 Simple Overfull Graphs; 4.4 Adjacency Lemmas for Critical Class Two Graphs; 4.5 Average Degree of Critical Class Two Graphs; 4.6 Independent Vertices in Critical Class Two Graphs; 4.7 Constructions of Critical Class Two Graphs; 4.8 Hadwiger's Conjecture for Line Graphs; 4.9 Simple Graphs on Surfaces; 4.10 Notes; 5 Tashkinov Trees; 5.1 Tashkinov's Method; 5.2 Extended Tashkinov Trees; 5.3 Asymptotic Bounds; 5.4 Tashkinov's Coloring Algorithm; 5.5 Polynomial Time Algorithms; 5.6 Notes; 6 Goldberg's Conjecture