Abstract
We are now at a point in this book where we have seen a number of different algorithms for the graph colouring problem and have noted many of their relative strengths and weaknesses. In this chapter we now present a range of problems, both theoretical- and practical-based, for which such algorithms might be applied.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Lewis, R.M.R. (2016). Applications and Extensions. In: A Guide to Graph Colouring. Springer, Cham. https://doi.org/10.1007/978-3-319-25730-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-25730-3_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25728-0
Online ISBN: 978-3-319-25730-3
eBook Packages: Computer ScienceComputer Science (R0)