Bibliographic Details
| Title: |
List-$k$-Coloring $H$-free graphs for all $k>4$ |
| Authors: |
Chudnovsky, Maria, Hajebi, Sepehr, Spirkl, Sophie |
| Publication Year: |
2023 |
| Collection: |
Mathematics |
| Subject Terms: |
Mathematics - Combinatorics |
| More Details: |
Given an integer $k>4$ and a graph $H$, we prove that, assuming P$\neq$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\geq 1$. |
| Document Type: |
Working Paper |
| Access URL: |
http://arxiv.org/abs/2311.05713 |
| Accession Number: |
edsarx.2311.05713 |
| Database: |
arXiv |
