Parameterized complexity of coloring problems: Treewidth versus vertex cover

Abstrakt

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

Klíčová slova

• Parameterized complexity
• coloring
• treewidth
• vertex cover