Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover (Extended abstract)

Abstract

We show that the parameterized complexity of similar problems varies if different ways of parameterization are applied.

Keywords

• Parameterized
• Complexity
• Coloring
• Problems
• Treewidth
• versus
• Vertex
• Cover
• Extended
• abstract