Skip to product information
1 of 1

R. M. R. Lewis

Guide to Graph Colouring: Algorithms and Applications

Guide to Graph Colouring: Algorithms and Applications

💎 Earn 208 Points (£2.08) on this item.

Important: Dispatches within 2 to 4 weeks
Regular price £41.64 GBP
Regular price £49.99 GBP Sale price £41.64 GBP
Sale Sold out
Taxes included. Shipping calculated at checkout.

YOU SAVE £8.35

  • Condition: Brand new
  • UK Delivery times: Usually arrives within 2 - 3 working days
  • UK Shipping: Fee starts at £2.39. Subject to product weight & dimension

Bulk ordering. Want 15 or more copies? Get a personalised quote and bigger discounts. Learn more about bulk orders.

  • More about Guide to Graph Colouring: Algorithms and Applications


This textbook explores the algorithmic problem of graph coloring, focusing on practical applications and analyzing popular algorithms for optimal solutions. It discusses the performance of these heuristics on graphs with unknown chromatic numbers and compares their effectiveness to other algorithms. The introductory chapters cover graph coloring, complexity theory, bounds, and constructive algorithms, and the book demonstrates how advanced techniques can be applied to real-world operational research problems. It is valuable for researchers, graduate students, and practitioners in operations research, theoretical computer science, optimization, and computational intelligence.

Format: Paperback / softback
Length: 304 pages
Publication date: 08 October 2022
Publisher: Springer Nature Switzerland AG


This comprehensive textbook delves into the realm of graph colouring, treating it as an algorithmic problem with a significant focus on practical applications. The author elucidates and examines various well-known algorithms for graph colouring, delving into their effectiveness in providing optimal solutions, their performance on graphs with unknown chromatic numbers, and their superiority compared to other algorithms for specific graph types.

The introductory chapters provide a solid foundation, introducing graph colouring, complexity theory, bounds, and constructive algorithms. The author then showcases how advanced graph colouring techniques can be applied to classic real-world operational research problems, such as designing seating plans, sports scheduling, and university timetabling. Numerous examples, suggestions for further reading, and historical notes enrich the book, complemented by an online suite of downloadable code.

This textbook holds immense value for researchers, graduate students, and practitioners in the fields of operations research, theoretical computer science, optimization, and computational intelligence. A basic understanding of sets, matrices, and enumerative combinatorics is assumed for the reader.

Weight: 492g
Dimension: 235 x 155 (mm)
ISBN-13: 9783030810566
Edition number: 2nd ed. 2021

This item can be found in:

UK and International shipping information

UK Delivery and returns information:

  • Delivery within 2 - 3 days when ordering in the UK.
  • Shipping fee for UK customers from £2.39. Fully tracked shipping service available.
  • Returns policy: Return within 30 days of receipt for full refund.

International deliveries:

Shulph Ink now ships to Australia, Belgium, Canada, France, Germany, Ireland, Italy, India, Luxembourg Saudi Arabia, Singapore, Spain, Netherlands, New Zealand, United Arab Emirates, United States of America.

  • Delivery times: within 5 - 10 days for international orders.
  • Shipping fee: charges vary for overseas orders. Only tracked services are available for most international orders. Some countries have untracked shipping options.
  • Customs charges: If ordering to addresses outside the United Kingdom, you may or may not incur additional customs and duties fees during local delivery.
View full details