Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm
Zdenĕk Dvořák, Daniel Král͏̌, Robin Thomas · arXiv (Cornell University) · 2016
We give a linear-time algorithm to decide 3-colorability of a triangle-free graph embedded in a fixed surface, and a quadratic-time algorithm to output a 3-coloring in the affirmative case. The algorithms also allow to prescribe the coloring of a bounded number of vertices.