Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider. Proving NP-hardness for clique-width I: non-approximability of sequential clique-width. Electronic Colloquium on Computational Complexity (ECCC), (080), 2005. [doi]
Abstract is missing.