Graph edge coloring
Subtitle: Vizing's theorem and Goldberg's conjecture
By: Michael Stiebitz ... [et al.].
Publisher: Wiley
Published: 2012
Place of publication: Hoboken, NJ
Language: eng
Number of pages: 321
ISBN-13: 9781118091371
Subjects: Graph coloring; MATHEMATICS / Discrete Mathematics; Graph theory
Description: "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"--

"This book provides an overview of this development as well as describes how the many different results are related"--
Notes: Includes bibliographical references and indexes.