<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T20:17:34Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/17563" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/17563</identifier><datestamp>2025-03-26T23:38:02Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9928</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Haxell, Penny</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="e794bdea-1a8b-4865-8bf7-f3434f215179" confidence="600">Saleh, Rana</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2021-09-28T14:22:49Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2021-09-28T14:22:49Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2021-09-28</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2021-08-30</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/17563</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">In this thesis, we study correspondence colouring and its applications to list colouring&#xd;
and delay colouring. We give a detailed exposition of the paper of Dvořák, and Postle&#xd;
introducing correspondence colouring.&#xd;
&#xd;
Moreover, we generalize two important results in delay colouring. The first is a result&#xd;
by Georgakopoulos, stating that cubic graphs are 4-delay colourable. We show that delay&#xd;
colouring can be formulated as an instance of correspondence colouring. Then we show that&#xd;
the modified line graph of a cubic bipartite graph is generally 4-correspondence colourable,&#xd;
using a Brooks’ type theorem for correspondence colouring. This allows us to give a more&#xd;
simple proof of a stronger result. The second result is one by Edwards and Kennedy, which&#xd;
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&#xd;
delay colouring. We then prove that the modified line graph of a quartic bipartite graph&#xd;
is 5-cyclic correspondence colourable using the Combinatorial Nullstellensatz.&#xd;
&#xd;
We also show that the maximum DP-chromatic number of any cycle plus triangles (CPT)&#xd;
graph is 4. We construct a CPT graph with DP-chromatic number at least 4. Moreover, the&#xd;
upper bound follows easily from the Brooks’ type theorem for correspondence colouring.&#xd;
Finally, we do a preliminary investigation into using parity techniques in correspondence&#xd;
colouring to prove that CPT graphs are 3-choosable.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Combinatorial Nullstellensatz</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Correspondence Colouring</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">DP colouring</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">list colouring</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">delay colouring</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">cycle plus triangles graphs</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Correspondence Colouring and its Applications to List Colouring and Delay Colouring</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="grantor" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws-etd" element="embargo" qualifier="terms" lang="en">0</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Haxell, Penny</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1" lang="en">Faculty of Mathematics</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="city" lang="en">Waterloo</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="country" lang="en">Canada</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="province" lang="en">Ontario</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>