Intractability of Clique-Width Parameterizations

We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are W[1]-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers, whether any of these problems is fixed parameter tractable when parameterized by the clique-width, that is, solvable in time g(k)

• Type: Journal
• Year: 2010
• Where: SIAMCOMP
• Authors: Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
• Keywords: Clique-width, Hamiltonian Cycle, Parameterized Complexity, SIAMCOMP 2010