Advertisement
Published in:
2002 | OriginalPaper | Chapter
Total Colouring Revisited
Authors : Michael Molloy, Bruce Reed
Published in: Graph Colouring and the Probabilistic Method
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.