Browsing Theses by Subject "list coloring"
Now showing items 1-2 of 2
-
Cliques, Degrees, and Coloring: Expanding the ω, Δ, χ paradigm
(University of Waterloo, 2019-08-09)Many of the most celebrated and influential results in graph coloring, such as Brooks' Theorem and Vizing's Theorem, relate a graph's chromatic number to its clique number or maximum degree. Currently, several of the most ... -
Thomassen’s 5-Choosability Theorem Extends to Many Faces
(University of Waterloo, 2021-09-10)We prove in this thesis that planar graphs can be L-colored, where L is a list-assignment in which every vertex has a 5-list except for a collection of arbitrarily large faces which have 3-lists, as long as those faces ...