Closing Complexity Gaps for Coloring Problems on H-Free Graphs

@inproceedings{Golovach2012ClosingCG,
  title={Closing Complexity Gaps for Coloring Problems on H-Free Graphs},
  author={Petr A. Golovach and Dani{\"e}l Paulusma and Jian Song},
  booktitle={ISAAC},
  year={2012}
}
If a graph G contains no subgraph isomorphic to some graph H, then G is called H-free. A coloring of a graph G = (V,E) is a mapping c : V → {1, 2, . . .} such that no two adjacent vertices have the same color, i.e., c(u) 6= c(v) if uv ∈ E; if |c(V )| ≤ k then c is a k-coloring. The Coloring problem is to test whether a graph has a coloring with at most k colors for some integer k. The Precoloring Extension problem is to decide whether a partial k-coloring of a graph can be extended to a k… CONTINUE READING