5-List-Coloring Graphs on Surfaces
Author(s)
Postle, Luke
Advisor(s)
Editor(s)
Collections
Supplementary to:
Permanent Link
Abstract
Thomassen proved that there are only finitely many 6-critical graphs embeddable on a fixed surface. He also showed that planar graphs are 5-list-colorable. We develop new techniques to prove a general theorem for 5-list-coloring graphs embedded on a fixed surface. Joint work with Robin Thomas.
Sponsor
NSF, NSA, ONR, IMA, Colleges of Sciences, Computing and Engineering
Date
2012-05
Extent
Resource Type
Text
Resource Subtype
Proceedings