Guide to Graph Colouring / Texts in Computer Science (PDF)

This unique textbook treats graph colouring as an algorithmic problem, with a strong emphasis on practical applications.

The work describes and analyses some of the best-known algorithms for colouring graphs, focusing on: whether these heuristics can provide optimal solutions in some cases; how they perform on graphs where the chromatic number is unknown; and whether they can produce better solutions than other algorithms for certain types of graphs, and why.

Introductory chapters explain graph colouring, complexity theory, bounds and constructive algorithms. Further exposition then shows 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. Readers should have elementary knowledge of sets, matrices, and enumerative combinatorics.

Topics and features:

• Suitable for graduate or upper-undergraduate courses in computer science, operations research, mathematics, and engineering
• Focuses on state-of-the-art algorithmic solutions to classic, real-world problems
• Supported by online suite of downloadable code
• Includes many examples, suggestions for further reading, and historical notes

This fine new edition will be of real value to graduate students, researchers, and practitioners in the areas of operations research, theoretical computer science, optimization, and computational intelligence. It thus will fulfill a dual role as both a key textbook for academia and a guidebook for professional self-study and pursuits.

Dr. Rhyd Lewis is a reader in operational research at Cardiff School of Mathematics, Cardiff University, UK. Previously he was a lecturer in quantitative methods at Cardiff Business School.