Recent developments on graphs of bounded clique-width

Marcin Kamiński, Vadim V. Lozin, Martin Milanič
2009 Discrete Applied Mathematics  
Whether the clique-width of graphs in a certain class of graphs is bounded or not, is an important question from an algorithmic point of view, as many problems that are NPhard in general admit polynomial-time solutions when restricted to graphs of bounded clique-width. Over the last few years, many classes of graphs have been shown to have bounded clique-width. For many others, this parameter has been proved to be unbounded. This paper provides a survey of recent results addressing this problem.
doi:10.1016/j.dam.2008.08.022 fatcat:h45w5c3pfrazbgyfboniyohhha