Now showing items 1-1 of 1

    • List-k-Coloring H-Free Graphs for All k > 4 

      Chudnovsky, Maria; Hajebi, Sepehr; Spirkl, Sophie (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 ...

      UWSpace

      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages