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

Paper Info

Title
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.

Authors (3 rows)

Cited by (3 rows)

References (4 rows)

Name	Order	Citations	PageRank
Maria Chudnovsky	1	15	4.18
Peter Maceli	2	13	4.47
Mingxian Zhong	3	4	1.48