Graph edge coloring: Vizing's theorem and Goldberg's conjecture
Gespeichert in:
Bibliographische Detailangaben
Format: Elektronisch E-Book
Sprache:English
Veröffentlicht: Hoboken, N.J. Wiley c2012
Schriftenreihe:Wiley series in discrete mathematics and optimization
Schlagworte:
Online-Zugang:Volltext
Beschreibung:"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
Includes bibliographical references and indexes
Beschreibung:1 Online-Ressource (xiv, 321 p.)
ISBN:9781280591617

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Volltext öffnen