Three-coloring graphs with no induced seven-vertex path I : the triangle-free case
classification
🧮 math.CO
cs.DM
keywords
inducedpathseven-vertextriangle-freealgorithmcasecolorablecoloring
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.