Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle

Zdenek Dvorak, Dan Kral, Robin Thomas

Let G be a plane graph with exactly one triangle T and all other cycles of length at least 5, and let C be a facial cycle of G of length at most six. We prove that a 3-coloring of…