Three-coloring graphs with no induced seven-vertex path I : the triangle-free case

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.

53 Pages, 3 figures

References in corpus (1)

• Three-coloring graphs with no induced seven-vertex path II : using a triangle

Cited by in corpus (1)

• Three-coloring graphs with no induced seven-vertex path II : using a triangle