Chudnovsky, MariaSpirkl, SophieZhong, Mingxian2022-08-152022-08-152019https://doi.org/10.1137/1.9781611975482.76http://hdl.handle.net/10012/18545© Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong | ACM} 2019. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms, https://doi.org/10.1137/1.9781611975482.76In this paper we present a polynomial time algorithm for the 4-COLORING PROBLEM and the 4-PRECOLORING EXTENSION problem restricted to the class of graphs with no induced six-vertex path, thus proving a conjecture of Huang. Combined with previously known results this completes the classification of the complexity of the 4-coloring problem for graphs with a connected forbidden induced subgraph.encolouringforbidden induced subgraphBook Chapter