Three-coloring graphs with no induced seven-vertex path I : the triangle-free case
Combinatorics
2014-09-19 v1 Discrete Mathematics
Abstract
In this paper, we give a polynomial time algorithm which determines if a given triangle-free graph with no induced seven-vertex path is 3-colorable, and gives an explicit coloring if one exists.
Cite
@article{arxiv.1409.5164,
title = {Three-coloring graphs with no induced seven-vertex path I : the triangle-free case},
author = {Maria Chudnovsky and Peter Maceli and Mingxian Zhong},
journal= {arXiv preprint arXiv:1409.5164},
year = {2014}
}
Comments
53 Pages, 3 figures