000 02226nam a2200373 a 4500
001 0000146859
005 20171002062046.0
006 m u
007 cr cn|||||||||
008 111018s2012 njua sb 001 0 eng d
010 _z 2011038045
020 _z9781118091371 (hardback)
020 _z9781118205563 (e-book)
035 _a(CaPaEBR)ebr10540916
035 _a(OCoLC)780445286
040 _aCaPaEBR
_cCaPaEBR
050 1 4 _aQA166.247
_b.G73 2012eb
082 0 4 _a511/.56
_223
245 0 0 _aGraph edge coloring
_h[electronic resource] :
_bVizing's theorem and Goldberg's conjecture /
_cMichael Stiebitz ... [et al.].
260 _aHoboken, N.J. :
_bWiley,
_c2012.
300 _axiv, 321 p. :
_bill.
490 1 _aWiley series in discrete mathematics and optimization
504 _aIncludes bibliographical references and indexes.
520 _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"--
_cProvided by publisher.
533 _aElectronic reproduction.
_bPalo Alto, Calif. :
_cebrary,
_d2013.
_nAvailable via World Wide Web.
_nAccess may be limited to ebrary affiliated libraries.
650 0 _aGraph coloring.
650 0 _aGraph theory.
655 7 _aElectronic books.
_2local
700 1 _aStiebitz, Michael,
_d1954-
710 2 _aebrary, Inc.
830 0 _aWiley series in discrete mathematics and optimization.
856 4 0 _uhttp://site.ebrary.com/lib/daystar/Doc?id=10540916
_zAn electronic book accessible through the World Wide Web; click to view
908 _a170314
942 0 0 _cEB
999 _c136008
_d136008