UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Thomassen’s 5-Choosability Theorem Extends to Many Faces

Thumbnail Image

Files

Nevin_Joshua.pdf (2.47 MB)

Date

2021-09-10

Authors

Nevin, Joshua

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

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 are at least a constant distance apart. Such a result is analogous to Thomassen’s 5-choosability proof where arbitrarily many faces, rather than just one face, are permitted to have 3-lists. This result can also be thought of as a stronger form of a conjecture of Albertson which was solved in 2012 and asked whether a planar graph can be 5-list-colored even if it contains distant precolored vertices. Our result has useful applications in proving that drawings with arbitrarily large pairwise far-apart crossing structures are 5-choosable under certain conditions, and we prove one such result at the end of this thesis.

Description

Keywords

graph coloring, topological graph theory, list coloring

LC Keywords

Citation

URI

http://hdl.handle.net/10012/17374

Collections

Theses
Combinatorics and Optimization