Well-quasi-ordering Does Not Imply Bounded Clique-width - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Vadim V. Lozin' in GoogleThis author has not been identified. Look up 'Igor Razgon' in GoogleThis author has not been identified. Look up 'Victor Zamaraev' in Google

runs on WebDSL