Browsing Waterloo Research by Subject "polynomial-time algorithms"
Now showing items 1-1 of 1
-
List-k-Coloring H-Free Graphs for All k > 4
(Springer, 2024-05-14)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 ...