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

Michael Stiebitz, Diego Scheide, Bjarne Toft, Lene Monrad Favrholdt

Publikation: Bog/rapportMonografiForskningpeer review

OriginalsprogEngelsk
UdgivelsesstedNew York
ForlagJohn Wiley & Sons Ltd
Antal sider335
ISBN (Trykt)111809137X
StatusUdgivet - 2012

Bibliografisk note

Wiley Series in Discrete mathematics and Optimization

Publisher Notes
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 edition of Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture is in a Hardcover format. This books publish date is February 2012 and it has a suggested retail price of $99.95. There are 288 pages in the book and it was published by John Wiley & Sons Inc.. The 10 digit ISBN is 111809137X and the 13 digit ISBN is 9781118091371.

Citationsformater