Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture


This product is not available in the selected currency.

Descripció

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 historical 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.

Detalls del producte

Editorial
John Wiley & Sons Inc
Data de publicació
Idioma
Anglès
Tipus
Tapa dura
EAN/UPC
9781118091371
Matèries IBIC:

Obtingues ingressos recomanant llibres

Genera ingressos compartint enllaços dels teus llibres favorits a través del programa d’afiliats.

Uneix-te al programa d’afiliats