Abstract
In Chap. 7, we constructed total colourings by first choosing an edge colouring and then choosing a vertex colouring which didn’t significantly conflict with it. We then obtained a total colouring by modifying the edge colouring so as to eliminate the conflicts. In this chapter, we take the opposite approach, first choosing a vertex colouring and then choosing an edge colouring which does not conflict at all with the vertex colouring, thereby obtaining a total colouring.
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
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Molloy, M., Reed, B. (2002). Total Colouring Revisited. In: Graph Colouring and the Probabilistic Method. Algorithms and Combinatorics, vol 23. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04016-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-04016-0_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04015-3
Online ISBN: 978-3-642-04016-0
eBook Packages: Springer Book Archive