Browsing Combinatorics and Optimization by Subject "list colouring"

Now showing items 1-3 of 3

Correspondence Colouring and its Applications to List Colouring and Delay Colouring

Saleh, Rana (University of Waterloo, 2021-09-28)

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, ...
List colouring hypergraphs and extremal results for acyclic graphs

Pei, Martin (University of Waterloo, 2008-05-21)

We study several extremal problems in graphs and hypergraphs. The first one is on list-colouring hypergraphs, which is a generalization of the ordinary colouring of hypergraphs. We discuss two methods for determining the ...
Local Perspectives on Planar Colouring

Smith-Roberge, Evelyne (University of Waterloo, 2022-08-09)

In 1994, Thomassen famously proved that every planar graph is 5-choosable, resolving a conjecture initially posed by Vizing and, independently, Erdos, Rubin, and Taylor in the 1970s. Later, Thomassen proved that every ...