Graph Edge Coloring Vizing's Theorem and Goldberg's Conjecture
Graph Edge Coloring Vizing's Theorem and Goldberg's Conjecture
- ISBN 13:
9781118091371
- ISBN 10:
111809137X
- Edition: 1st
- Format: Hardcover
- Copyright: 02/14/2012
- Publisher: Wiley
New From $137.23
Sorry, this item is currently unavailable.
List Price $138.61 Save $1.38
New
$137.23
Print on Demand: 2-4 Weeks. This item cannot be cancelled or returned.
We Buy This Book Back!
Included with your book
Free Shipping On Every Order
Note: Supplemental materials are not guaranteed with Rental or Used book purchases.
Extend or Purchase Your Rental at Any Time
Need to keep your rental past your due date? At any time before your due date you can extend or purchase your rental through your account.
Summary
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.