Well-quasi-ordering does not imply bounded clique-width
classification
💻 cs.DM
math.CO
keywords
clique-widthansweraskedboundedclassdaligaultfunctionsgraphs
read the original 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\'e in ("Well-quasi-order of relabel functions", Order, 27(3):301--315, 2010).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.