Well-quasi-ordering does not imply bounded clique-width
Discrete Mathematics
2015-03-03 v1 Combinatorics
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).
Keywords
Cite
@article{arxiv.1503.00571,
title = {Well-quasi-ordering does not imply bounded clique-width},
author = {Vadim Lozin and Igor Razgon and Viktor Zamaraev},
journal= {arXiv preprint arXiv:1503.00571},
year = {2015}
}