Well-quasi-ordering does not imply bounded clique-width

Abstract

We present a hereditary class of graphs of unbounded clique-width which is well-quasi-ordered by the induced subgraph relation. This result provides a negative answer to the question asked by Daligault, Rao and Thomassé in ("Well-quasi-order of relabel functions", Order, 27(3):301--315, 2010).

Cited by in corpus (1)

• Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes