MARC Record from Library of Congress

LEADER: 02005cam a22003254a 4500
001 2011038045
003 DLC
005 20120522173623.0
008 111018s2012 njua b 001 0 eng
010 $a 2011038045
016 7 $a016051502$2Uk
020 $a9781118091371 (hardback)
020 $a111809137X (hardback)
035 $a(OCoLC)ocn747529203
040 $aDLC$beng$cDLC$dYDX$dBTCTA$dYDXCP$dBDX$dUKMGB$dDLC
042 $apcc
050 00 $aQA166.247$b.G73 2012
082 00 $a511/.56$223
084 $aMAT008000$2bisacsh
245 00 $aGraph edge coloring :$bVizing's theorem and Goldberg's conjecture /$cMichael Stiebitz ... [et al.].
260 $aHoboken, N.J. :$bWiley,$cc2012.
300 $axiv, 321 p. :$bill. ;$c24 cm.
490 1 $aWiley series in discrete mathematics and optimization
500 $a"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.
520 $a"This book provides an overview of this development as well as describes how the many different results are related"--$cProvided by publisher.
504 $aIncludes bibliographical references and indexes.
650 0 $aGraph coloring.
650 0 $aGraph theory.
700 1 $aStiebitz, Michael,$d1954-
830 0 $aWiley series in discrete mathematics and optimization.