Some Extensions of Thomassen's Theorem to Longer Paths
Abstract
Let G be a planar embedding with list-assignment L and outer cycle C, and let P be a path of length at most four on C, where each vertex of G C has a list of size at least five and each vertex of C P has a list of size at least three. In this paper, we prove some results about partial L-colorings φ of C with the property that any extension of φ to an L-coloring of dom(φ) V(P) extends to L-color all of G. We use these results in a later sequence of papers to prove some results about list-colorings of high-representativity embeddings on surfaces.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.