000 02314nam a2200409 a 4500
001 EBC817847
003 MiAaPQ
005 20240120133011.0
006 m o d |
007 cr cn|||||||||
008 111018s2012 njua sb 001 0 eng d
010 _z 2011038045
020 _z9781118091371 (hardback)
020 _a9781118205563 (electronic bk.)
035 _a(MiAaPQ)EBC817847
035 _a(Au-PeEL)EBL817847
035 _a(CaPaEBR)ebr10540916
035 _a(CaONFJC)MIL362144
035 _a(OCoLC)780445286
040 _aMiAaPQ
_cMiAaPQ
_dMiAaPQ
050 4 _aQA166.247
_b.G73 2012
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. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries.
650 0 _aGraph coloring.
650 0 _aGraph theory.
655 4 _aElectronic books.
700 1 _aStiebitz, Michael,
_d1954-
710 2 _aProQuest (Firm)
830 0 _aWiley series in discrete mathematics and optimization.
856 4 0 _uhttps://ebookcentral.proquest.com/lib/bacm-ebooks/detail.action?docID=817847
_zClick to View
999 _c71708
_d71708