List-three-coloring graphs with no induced $P_6+rP_3$
Combinatorics
2018-07-03 v2
Abstract
For an integer , the graph has components, one of which is a path on vertices, and each of the others is a path on vertices. In this paper we provide a polynomial-time algorithm to test if a graph with no induced subgraph isomorphic to is three-colorable. We also solve the list version of this problem, where each vertex is assigned a list of possible colors, which is a subset of .
Keywords
Cite
@article{arxiv.1806.11196,
title = {List-three-coloring graphs with no induced $P_6+rP_3$},
author = {Maria Chudnovsky and Shenwei Huang and Sophie Spirkl and Mingxian Zhong},
journal= {arXiv preprint arXiv:1806.11196},
year = {2018}
}