Part of the Lecture Notes in Computer Science book series (LNCS, volume 9224)
Well-quasi-ordering Does Not Imply Bounded Clique-width
We present a hereditary class of graphs of unbounded clique-width which is well-quasi-ordered by the induced subgraph relation. This result provides the negative answer to a question asked by Daligault, Rao and Thomassé in .
- 1.Atminas, A., Lozin, V.V., Razgon, I.: Well-quasi-ordering, tree-width and subquadratic properties of graphs. CoRR, abs/1410.3260 (2014)Google Scholar
© Springer-Verlag Berlin Heidelberg 2016