Abstract
Towards the end of the previous chapter we saw a variety of different types of graphs that are relatively straightforward to colour optimally, including complete graphs, bipartite graphs, cycle and wheel graphs, and grid graphs. With regard to the chromatic number, we also saw that it is easy to determine when χ = G = 1 (G is an empty graph), and when χ = G = 2 (G is bipartite). But can we go further than this?
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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). Bounds and Constructive Algorithms. In: A Guide to Graph Colouring. Springer, Cham. https://doi.org/10.1007/978-3-319-25730-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-25730-3_2
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)