Correspondence Colouring and its Applications to List Colouring and Delay Colouring
MetadataShow full item record
In this thesis, we study correspondence colouring and its applications to list colouring and delay colouring. We give a detailed exposition of the paper of Dvořák, and Postle introducing correspondence colouring. Moreover, we generalize two important results in delay colouring. The first is a result by Georgakopoulos, stating that cubic graphs are 4-delay colourable. We show that delay colouring can be formulated as an instance of correspondence colouring. Then we show that the modified line graph of a cubic bipartite graph is generally 4-correspondence colourable, using a Brooks’ type theorem for correspondence colouring. This allows us to give a more simple proof of a stronger result. The second result is one by Edwards and Kennedy, which states that quartic bipartite graphs are 5-delay colourable. We introduce the notion of p-cyclic correspondence colouring which is a type of correspondence colouring that generalizes delay colouring. We then prove that the modified line graph of a quartic bipartite graph is 5-cyclic correspondence colourable using the Combinatorial Nullstellensatz. We also show that the maximum DP-chromatic number of any cycle plus triangles (CPT) graph is 4. We construct a CPT graph with DP-chromatic number at least 4. Moreover, the upper bound follows easily from the Brooks’ type theorem for correspondence colouring. Finally, we do a preliminary investigation into using parity techniques in correspondence colouring to prove that CPT graphs are 3-choosable.
Cite this version of the work
Rana Saleh (2021). Correspondence Colouring and its Applications to List Colouring and Delay Colouring. UWSpace. http://hdl.handle.net/10012/17563
Showing items related by title, author, creator and subject.
Redlin, Shayla (University of Waterloo, 2018-09-04)An acyclic k-colouring of a graph G is a proper k-colouring of G with no bichromatic cycles. In 1979, Borodin proved that planar graphs are acyclically 5-colourable, an analog of the Four Colour Theorem. Kawarabayashi and ...
Almustanyir, Ali (University of Waterloo, 2018-06-19)Introduction: Individuals with congenital colour vision deficiencies are at a greater risk of making an error in colour judgment. Computerized colour vision tests are now available to screen for colour vision defects and ...
Ramaswamy, Shankaran (University of Waterloo, 2009-04-29)Introduction Colour codes are used extensively in railways to convey specific information governing movement of trains and equipment on the track. One such task is the railway traffic control display that uses colour coded ...