Well-quasi-ordering does not imply bounded clique-width
@inproceedings{LRZ16, address = {Berlin, Heidelberg}, archiveprefix = {arXiv}, author = {Lozin, Vadim V. and Razgon, Igor and Zamaraev, Viktor}, booktitle = {Graph-Theoretic Concepts in Computer Science}, doi = {10.1007/978-3-662-53174-7_25}, eprint = {1503.00571v1}, isbn = {978-3-662-53173-0,978-3-662-53174-7}, pages = {351--359}, primaryclass = {cs.DM}, publisher = {Springer Berlin Heidelberg}, sha256 = {FA2B64283E2F45830B7BDCCC6C12483F1DB81B96A7491024DE3CF94EB89BEC59}, title = {Well-quasi-ordering does not imply bounded clique-width}, year = {2016} }