Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma. Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes. In Hans L. Bodlaender, Gerhard J. Woeginger, editors, Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers. Volume 10520 of Lecture Notes in Computer Science, pages 220-233, Springer, 2017. [doi]

The following publications are possibly variants of this publication:

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]

On the Clique-Width of Graphs in Hereditary ClassesRodica Boliac, Vadim V. Lozin. isaac 2002: 44-54 [doi]

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]

The Clique-Width of Bipartite Graphs in Monogenic ClassesVadim V. Lozin, Jordan Volz. ijfcs, 19(2):477-494, 2008. [doi]

Clique-width for hereditary graph classesKonrad K. Dabrowski, Matthew Johnson 0002, Daniël Paulusma. bcc 2019: 1-56 [doi]

runs on WebDSL