@inproceedings{3fa7c2a11ac24ae490a16c9f05317675,
title = "Well-quasi-ordering does not imply bounded clique-width",
abstract = "We present a hereditary class of graphs of unbounded cliquewidth 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{\'e} in [3].",
author = "Lozin, {Vadim V.} and Igor Razgon and Viktor Zamaraev",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.; 41st International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2015 ; Conference date: 17-06-2015 Through 19-06-2015",
year = "2016",
month = jan,
day = "1",
doi = "10.1007/978-3-662-53174-7_25",
language = "English",
isbn = "9783662531730",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "351--359",
editor = "Mayr, {Ernst W.}",
booktitle = "Graph-Theoretic Concepts in Computer Science - 41st International Workshop, WG 2015, Revised Papers",
address = "Germany",
}