Well-quasi-ordering Does Not Imply Bounded Clique-width

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]

Abstract

Abstract is missing.