2000 character limit reached
Three-coloring graphs with no induced seven-vertex path I : the triangle-free case
Published 17 Sep 2014 in math.CO and cs.DM | (1409.5164v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper.