Chudnovsky, MariaHajebi, SepehrSpirkl, Sophie2024-05-242024-05-242024-05-14https://doi.org/10.1007/s00493-024-00106-2http://hdl.handle.net/10012/20595This is a post-peer-review, pre-copyedit version of an article published in Combinatorica. The final authenticated version is available online at: https://doi.org/10.1007/s00493-024-00106-2Given an integer k > 4 and a graph H, we prove that, assuming P =/ NP, the LIST-k-COLORING PROBLEM restricted to H-free graphs can be solved in polynomial time if and only if either every component of H is a path on at most three vertices, or removing the isolated vertices of H leaves an induced subgraph of the five-vertex path. In fact, the "if" implication holds for all k>_ 1.encoloringlist-coloringinduced subgraphspolynomial-time algorithmsArticle