Topics in Chromatic Graph Theory
Part of Encyclopedia of Mathematics and its Applications
- Editors:
- Lowell W. Beineke, Purdue University, Indiana
- Robin J. Wilson, The Open University, Milton Keynes
- Date Published: May 2015
- availability: Available
- format: Hardback
- isbn: 9781107033504
Hardback
Other available formats:
eBook
Looking for an inspection copy?
Please email academicmarketing@cambridge.edu.au to enquire about an inspection copy of this book
-
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.
Read more- 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
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: May 2015
- format: Hardback
- isbn: 9781107033504
- length: 386 pages
- dimensions: 241 x 163 x 25 mm
- weight: 0.72kg
- contains: 65 b/w illus.
- availability: Available
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.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×