A Guide to Graph ColouringAlgorithms and Applications\nAuthor(s): R.M.R. Lewis\nFormat: Paperback\nPublisher: Springer International Publishing AG, Switzerland\nImprint: Springer International Publishing AG\nISBN-13: 9783319372822, 978-3319372822\nSynopsis\nThis book treats graph colouring as an algorithmic problem, with a strong emphasis on practical applications. The author describes and analyses some of the best-known algorithms for colouring arbitrary 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.\n\nThe introductory chapters explain graph colouring, and bounds and constructive algorithms. The author then shows how advanced, modern techniques can be applied to classic real-world operational research problems such as seating plans, sports scheduling, and university time.