We show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width k for some fixed integer k.
No takes yet. Share an insight, caveat, or question.
Espelage et al. (2003) studied this question.