@article{a076a3ff578343c09659519e2727f9b7,
title = "4-Coloring P6-Free Graphs with No Induced 5-Cycles",
abstract = "We show that the 4-coloring problem can be solved in polynomial time for graphs with no induced 5-cycle C5 and no induced 6-vertex path P6.",
keywords = "algorithm, coloring, induced subgraphs, path",
author = "Maria Chudnovsky and Peter Maceli and Juraj Stacho and Mingxian Zhong",
note = "Funding Information: We are grateful to Rafael Saul Chudnovsky Panner without whose cooperation this research would not have been possible. The authors were partially supported by the NSF grants. Publisher Copyright: {\textcopyright} 2016 Wiley Periodicals, Inc.",
year = "2017",
month = mar,
day = "1",
doi = "10.1002/jgt.22025",
language = "English (US)",
volume = "84",
pages = "262--285",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "3",
}