Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations
Combinatorics
2020-08-20 v2 Discrete Mathematics
Abstract
We give a linear-time algorithm to decide 3-colorability (and find a 3-coloring, if it exists) of quadrangulations of a fixed surface. The algorithm also allows to prescribe the coloring for a bounded number of vertices.
Cite
@article{arxiv.1509.01013,
title = {Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations},
author = {Zdenek Dvorak and Daniel Kral and Robin Thomas},
journal= {arXiv preprint arXiv:1509.01013},
year = {2020}
}
Comments
32 pages, no figures; updated for reviewer comments