Printer Friendly

Graph edge coloring; Vizing's theorem and Goldberg's conjecture.


Graph edge coloring; Vizing's theorem and Goldberg's conjecture.

Ed. by Michael Stiebitz et al.

John Wiley & Sons


321 pages



Wiley series in discrete mathematics and optimization


The edge color problem is to determine how many colors are needed to color the edges of a graph, such that no two adjacent edges--no intersecting lines--receive the same color. It is related to the four-color theorem for maps. A team of European mathematicians walks through the various approaches and perspectives. They cover Vizing fans, Kierstead paths, simple graphs and line graphs, Tashninov trees, Goldberg's conjecture, extreme graphs, generalized edge colorings of graphs, and 20 pretty edge coloring conjectures.

([c]2012 Book News, Inc., Portland, OR)

COPYRIGHT 2012 Book News, Inc.
No portion of this article can be reproduced without the express written permission from the copyright holder.
Copyright 2012 Gale, Cengage Learning. All rights reserved.

Article Details
Printer friendly Cite/link Email Feedback
Publication:Reference & Research Book News
Article Type:Book review
Date:Apr 1, 2012
Previous Article:Fundamentals of software testing.
Next Article:Chevalley supergroups.

Terms of use | Copyright © 2017 Farlex, Inc. | Feedback | For webmasters