Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Recommended product

Popular links

Popular links


Topics in Chromatic Graph Theory

Topics in Chromatic Graph Theory

Topics in Chromatic Graph Theory

Lowell W. Beineke, Purdue University, Indiana
Robin J. Wilson, The Open University, Milton Keynes
May 2015
Hardback
9781107033504
NZD$249.95
inc GST
Hardback
USD
eBook

    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.

    • Timely coverage of a rapidly expanding area
    • Clear, well-written exposition from world leaders in the field
    • Provides extensive references and an introductory chapter covering background material

    Product details

    May 2015
    Adobe eBook Reader
    9781316236079
    0 pages
    0kg
    65 b/w illus.
    This ISBN is for an eBook version which is distributed on our behalf by a third party.

    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.
      Contributors
    • Bjarne Toft, Lowell W. Beineke, Robin J. Wilson, Bojan Mohar, Michael Stiebitz, Bill Jackson, Ken-ichi Kawarabayashi, Jessica McDonald, Margit Voigt, Nicolas Trotignon, Alexander Soifer, Hongjian Lai, Rong Luo, Cun-Quan Zhang, Ross J. Kang, Colin McDiarmid, Csilla Bujtas, Zsolt Tuza, Vitaly Voloshin, Dominique de Werra, Alain Hertz, Thore Husfeldt, Xuding Zhu, Tommy Jensen