@article{9bb6acd7e7ca470c9d5d3bc0cf4133a9,
title = "3-colorable subclasses OF P8-FREE GRAPHS∗ ",
abstract = "In this paper, we study 3-colorable graphs having no induced 8-vertex path and no induced cycles of specific lengths. We prove a characterization by critical graphs in three particular cases.",
keywords = "Coloring, Forbidden induced subgraphs, Induced paths",
author = "Maria Chudnovsky and Juraj Stacho",
note = "Funding Information: ∗Received by the editors November 23, 2016; accepted for publication (in revised form) March 5, 2018; published electronically May 15, 2018. http://www.siam.org/journals/sidma/32-2/M110485.html Funding: The first author was partially supported by NSF grants IIS-1117631 and DMS-1265803. †Mathematics Department, Princeton University, Princeton, NJ (mchudnov@math.princeton. edu). ‡Google, Zurich, Switzerland (stacho@cs.toronto.edu). Funding Information: The first author was partially supported by NSF grants IIS-1117631 and DMS-1265803. The first part of the paper contains joint work with Paul Seymour, to whom we owe gratitude. His contribution is included here with his permission. This research was started during a Graph Theory workshop in Bellairs Research Institute.",
year = "2018",
doi = "10.1137/16M1104858",
language = "English (US)",
volume = "32",
pages = "1111--1138",
journal = "SIAM Journal on Discrete Mathematics",
issn = "0895-4801",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "2",
}