List-k-Coloring H-Free Graphs for All k > 4
| dc.contributor.author | Chudnovsky, Maria | |
| dc.contributor.author | Hajebi, Sepehr | |
| dc.contributor.author | Spirkl, Sophie | |
| dc.date.accessioned | 2024-05-24T16:02:39Z | |
| dc.date.available | 2024-05-24T16:02:39Z | |
| dc.date.issued | 2024-05-14 | |
| dc.description | This 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-2 | en |
| dc.description.abstract | Given 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. | en |
| dc.description.sponsorship | Natural Sciences and Engineering Research Council of Canada (NSERC), RGPIN-2020-03912 || Government of Ontario || Alfred P. Sloan Fellow || NSF-EPSRC, Grant DMS-2120644 || AFOSR, Grant FA9550-22-1-0083. | en |
| dc.identifier.uri | https://doi.org/10.1007/s00493-024-00106-2 | |
| dc.identifier.uri | http://hdl.handle.net/10012/20595 | |
| dc.language.iso | en | en |
| dc.publisher | Springer | en |
| dc.relation.ispartofseries | Combinatorica; | |
| dc.subject | coloring | en |
| dc.subject | list-coloring | en |
| dc.subject | induced subgraphs | en |
| dc.subject | polynomial-time algorithms | en |
| dc.title | List-k-Coloring H-Free Graphs for All k > 4 | en |
| dc.type | Article | en |
| dcterms.bibliographicCitation | Chudnovsky, M., Hajebi, S., & Spirkl, S. (2024). List-K-coloring h-free graphs for all K>4. Combinatorica. https://doi.org/10.1007/s00493-024-00106-2 | en |
| uws.contributor.affiliation1 | Faculty of Mathematics | en |
| uws.contributor.affiliation2 | Combinatorics and Optimization | en |
| uws.peerReviewStatus | Reviewed | en |
| uws.scholarLevel | Faculty | en |
| uws.typeOfResource | Text | en |