Josh W. Nevin

collaborators

4 papers

math.CO2024

Distant 2-Colored Components on Embeddings Part III: The General Case

Joshua Nevin

This is the third in a sequence of three papers in which we prove the following generalization of Thomassen's 5-choosability theorem: Let $G$ be a finite graph embedded on a surfac…

math.CO2024

Distant 2-Colored Components on Embeddings Part II: The Short-Inseparable Case

Joshua Nevin

This is the second in a sequence of three papers in which we prove the following generalization of Thomassen's 5-choosability theorem: Let $G$ be a graph embedded on a surface of g…

math.CO2024

Distant 2-Colored Components on Embeddings Part I: Connecting Faces

Joshua Nevin

This is the first in a sequence of three papers in which we prove the following generalization of Thomassen's 5-choosability theorem: Let $G$ be a finite graph embedded on a surfac…

math.CO2024

Some Extensions of Thomassen's Theorem to Longer Paths

Joshua Nevin

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 s…