Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm
Discrete Mathematics
2020-11-10 v2 Combinatorics
Abstract
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.
Cite
@article{arxiv.1601.01197,
title = {Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm},
author = {Zdenek Dvorak and Daniel Kral and Robin Thomas},
journal= {arXiv preprint arXiv:1601.01197},
year = {2020}
}
Comments
22 pages, no figures; updated for reviewer remarks, reworked the final section. arXiv admin note: text overlap with arXiv:1509.01013