MARC Record from Library of Congress

LEADER: 03339cam a2200349 i 4500
001 2014035297
003 DLC
005 20150820080354.0
008 140904s2015 uk a b 001 0 eng
010 $a 2014035297
020 $a9781107033504 (hardback)
040 $aDLC$beng$cDLC$erda$dDLC
042 $apcc
050 00 $aQA166.247$b.T67 2015
082 00 $a511/.56$223
084 $aMAT008000$2bisacsh
245 00 $aTopics in chromatic graph theory /$cedited by Lowell W. Beineke, Indiana University-Purdue University, Fort Wayne, Robin J. Wilson, The Open University and the London School of Economics ; academic consultant, Bjarne Toft, University of Southern Denmark, Odense.
264 1 $aCambridge, United Kingdom:$bCambridge University Press,$c2015.
300 $axvi, 370 pages :$billustrations ;$c24 cm.
336 $atext$2rdacontent
337 $aunmediated$2rdamedia
338 $avolume$2rdacarrier
490 0 $aEncyclopedia of mathematics and its applications ;$v156
504 $aIncludes bibliographical references and index.
520 $a"Chromatic graph theory is a thriving area that uses various ideas of 'colouring' (of vertices, edges, and so on) to explore aspects of graph theory. It has links with other areas of mathematics, including topology, algebra and geometry, and is increasingly used in such areas as computer networks, where colouring algorithms form an important feature. While other books cover portions of the material, no other title has such a wide scope as this one, in which acknowledged international experts in the field provide a broad survey of the subject. All fifteen chapters have been carefully edited, with uniform notation and terminology applied throughout. Bjarne Toft (Odense, Denmark), widely recognized for his substantial contributions to the area, acted as academic consultant. The book serves as a valuable reference for researchers and graduate students in graph theory and combinatorics and as a useful introduction to the topic for mathematicians in related fields"--$cProvided by publisher.
505 8 $aMachine generated contents note: Foreword Bjarne Toft; Preface; Preliminaries Lowell W. Beineke and Robin J. Wilson; 1. Colouring graphs on surfaces Bojan Mohar; 2. Brooks's theorem Michael Stiebitz and Bjarne Toft; 3. Chromatic polynomials Bill Jackson; 4. Hadwiger's conjecture Ken-ichi Kawarabayashi; 5. Edge-colourings Jessica McDonald; 6. List-colourings Michael Stiebitz and Margit Voigt; 7. Perfect graphs Nicolas Trotignon; 8. Geometric graphs Alexander Soifer; 9. Integer flow and orientation Hongjian Lai, Rong Luo and Cun-Quan Zhang; 10. Colouring random graphs Ross J. Kang and Colin McDiarmid; 11. Hypergraph colouring Csilla Bujtas, Zsolt Tuza and Vitaly Voloshin; 12. Chromatic scheduling Dominique de Werra and Alain Hertz; 13. Graph colouring algorithms Thore Husfeldt; 14. Colouring games Zsolt Tuza and Xuding Zhu; 15. Unsolved graph colouring problemsTommy Jensen and Bjarne Toft; Notes on contributors; Index.
650 0 $aGraph coloring$xData processing.
650 0 $aGraph theory$xData processing.
650 7 $aMATHEMATICS / Discrete Mathematics.$2bisacsh
700 1 $aBeineke, Lowell W.,$eeditor.
700 1 $aWilson, Robin J.,$eeditor.
856 42 $3Cover image$uhttp://assets.cambridge.org/97811070/33504/cover/9781107033504.jpg