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.
CITATION STYLE
Lewis, R. M. R. (2016). Applications and Extensions. In A Guide to Graph Colouring (pp. 111–149). Springer International Publishing. https://doi.org/10.1007/978-3-319-25730-3_5
Mendeley helps you to discover research relevant for your work.