Three-coloring graphs with no induced seven-vertex path II : using a triangle
Discrete Mathematics
2015-03-25 v2 Combinatorics
Abstract
In this paper, we give a polynomial time algorithm which determines if a given graph containing a triangle and no induced seven-vertex path is 3-colorable, and gives an explicit coloring if one exists. In previous work, we gave a polynomial time algorithm for three-coloring triangle-free graphs with no induced seven-vertex path. Combined, our work shows that three-coloring a graph with no induced seven-vertex path can be done in polynomial time.
Keywords
Cite
@article{arxiv.1503.03573,
title = {Three-coloring graphs with no induced seven-vertex path II : using a triangle},
author = {Maria Chudnovsky and Peter Maceli and Mingxian Zhong},
journal= {arXiv preprint arXiv:1503.03573},
year = {2015}
}
Comments
26 pages