Graphs and Matroids Seminar
Title: Extending Thomassen’s Theorem to Two Faces
Speaker: | Joshua Nevin |
Affiliation: | University of Waterloo |
Room: | MC 5417 |
Abstract:
Let G be a planar graph and let L be a list-assignment for G in which there is a precolored edge on the outer face, every other vertex on the outer face has a list of size at least 3, and every other vertex in G has a list of size at least 5.