Graph Edge Coloring

Graph Edge Coloring

Vizing's Theorem and Goldberg's Conjecture

eBook - 2012
Rate this:
"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.
Publisher: Hoboken, N.J. : Wiley, 2012.
ISBN: 9781118205563
9781118091371
Characteristics: 1 online resource (xiv, 321 pages) : illustrations.
Additional Contributors: Stiebitz, Michael 1954-
ebrary, Inc

Opinion

From the critics


Community Activity

Comment

Add a Comment

There are no comments for this title yet.

Age

Add Age Suitability

There are no ages for this title yet.

Summary

Add a Summary

There are no summaries for this title yet.

Notices

Add Notices

There are no notices for this title yet.

Quotes

Add a Quote

There are no quotes for this title yet.

Explore Further

Subject Headings

  Loading...

Find it at KCLibrary

  Loading...
[]
[]
To Top