3-coloring triangle-free planar graphs with a precolored 8-cycle
Combinatorics
2016-12-16 v1 Discrete Mathematics
Abstract
Let G be a planar triangle-free graph and let C be a cycle in G of length at most 8. We characterize all situations where a 3-coloring of C does not extend to a proper 3-coloring of the whole graph.
Keywords
Cite
@article{arxiv.1305.2467,
title = {3-coloring triangle-free planar graphs with a precolored 8-cycle},
author = {Zdeněk Dvořák and Bernard Lidický},
journal= {arXiv preprint arXiv:1305.2467},
year = {2016}
}
Comments
20 pages, 5 figures