jump to search box

Graph edge coloring : Vizing's theorem and Goldberg's conjecture / Michael Stiebitz ... [et al.].

Availability

Online

At the Library

Other libraries

Language:
English.
Publication date:
2012
Imprint:
Hoboken, N.J. : Wiley, c2012.
Format:
  • Book
  • xiv, 321 p. : ill ; 24 cm.
Note:
"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.
Bibliography:
Includes bibliographical references (p. 295-311) and indexes.
Summary:
"This book provides an overview of this development as well as describes how the many different results are related"-- Provided by publisher.
Contributor:
Stiebitz, Michael, 1954-
Series:
Wiley series in discrete mathematics and optimization.
Subjects:
ISBN:
9781118091371
111809137X

powered by Blacklight
© Stanford University. Stanford, California 94305. (650) 725-1064. Terms of Use | Copyright Complaints | Opt Out of Analytics
jump to top