Well-quasi-ordering versus clique-width - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Vadim V. Lozin, Igor Razgon, Viktor Zamaraev. Well-quasi-ordering versus clique-width. Journal of Combinatorial Theory, Series A, 130:1-18, 2018. [doi]

The following publications are possibly variants of this publication:

Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic ClassesKonrad Dabrowski, Vadim V. Lozin, Daniël Paulusma. iwoca 2016: 253-265 [doi]

Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic ClassesKonrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma. order, 35(2):253-274, 2018. [doi]

Well-quasi-ordering Does Not Imply Bounded Clique-widthVadim V. Lozin, Igor Razgon, Victor Zamaraev. wg 2016: 351-359 [doi]

Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph ClassesKonrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma. wg 2017: 220-233 [doi]

Clique-width and well-quasi-ordering of triangle-free graph classesKonrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma. jcss, 108:64-91, 2020. [doi]

Well-Quasi-Order for Permutation Graphs Omitting a Path and a CliqueAistis Atminas, Robert Brignall, Nicholas Korpelainen, Vadim V. Lozin, Vincent Vatter. combinatorics, 22(2):2, 2015. [doi]

runs on WebDSL