Vadim V. Lozin, Igor Razgon, Victor Zamaraev. Well-quasi-ordering Does Not Imply Bounded Clique-width. In Ernst W. Mayr, editor, Graph-Theoretic Concepts in Computer Science - 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers. Volume 9224 of Lecture Notes in Computer Science, pages 351-359, Springer, 2015. [doi]
@inproceedings{LozinRZ15, title = {Well-quasi-ordering Does Not Imply Bounded Clique-width}, author = {Vadim V. Lozin and Igor Razgon and Victor Zamaraev}, year = {2015}, doi = {10.1007/978-3-662-53174-7_25}, url = {http://dx.doi.org/10.1007/978-3-662-53174-7_25}, researchr = {https://researchr.org/publication/LozinRZ15}, cites = {0}, citedby = {0}, pages = {351-359}, booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers}, editor = {Ernst W. Mayr}, volume = {9224}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-662-53173-0}, }