Graph edge coloring [electronic resource] : Vizing's theorem and Goldberg's conjecture / Michael Stiebitz ... [et al.].

Contributor(s): Stiebitz, Michael, 1954- | ProQuest (Firm)Material type: TextTextSeries: Wiley series in discrete mathematics and optimizationPublication details: Hoboken, N.J. : Wiley, 2012Description: xiv, 321 p. : illISBN: 9781118205563 (electronic bk.)Subject(s): Graph coloring | Graph theoryGenre/Form: Electronic books.DDC classification: 511/.56 LOC classification: QA166.247 | .G73 2012Online resources: Click to View 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"-- Provided by publisher.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

Includes bibliographical references and indexes.

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

Electronic reproduction. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries.

There are no comments on this title.

to post a comment.