Browsing Theses by Subject "correspondence colouring"
Now showing items 1-1 of 1
-
Local Perspectives on Planar Colouring
(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 ...