Topics in Chromatic Graph Theory: (Series Number 156 Encyclopedia of Mathematics and its Applications)

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.

Table of Contents:
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. Open problems Tommy Jensen and Bjarne Toft; Notes on contributors; Index.

About the Author :
Lowell W. Beineke is Schrey Professor of Mathematics at Indiana University-Purdue University, Fort Wayne (IPFW), where he has worked since receiving his PhD from the University of Michigan under the guidance of Frank Harary. His graph theory interests include topological graph theory, line graphs, tournaments, decompositions and vulnerability. He has published over 100 papers in graph theory and has served as editor of the College Mathematics Journal. With Robin Wilson he has co-edited five books in addition to the three earlier volumes in this series. Recent honours include an award instituted in his name by the College of Arts and Sciences at IPFW and a Certificate of Meritorious Service from the Mathematical Association of America. Robin J. Wilson is Emeritus Professor of Pure Mathematics at the Open University, UK, and Emeritus Professor of Geometry at Gresham College, London. After graduating from Oxford, he received his PhD in number theory from the University of Pennsylvania. He has written and co-edited many books on graph theory and the history of mathematics, including Introduction to Graph Theory, Four Colors Suffice and Combinatorics: Ancient and Modern. His combinatorial research interests formerly included graph colourings and now focus on the history of combinatorics. An enthusiastic populariser of mathematics, he has won two awards for his expository writing from the Mathematical Association of America.