Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes
- 107 Downloads
Daligault, Rao and Thomassé asked whether a hereditary class of graphs well-quasi-ordered by the induced subgraph relation has bounded clique-width. Lozin, Razgon and Zamaraev recently showed that this is not true for classes defined by infinitely many forbidden induced subgraphs. However, in the case of finitely many forbidden induced subgraphs the question remains open and we conjecture that in this case the answer is positive. The conjecture is known to hold for classes of graphs defined by a single forbidden induced subgraph H, as such graphs are well-quasi-ordered and are of bounded clique-width if and only if H is an induced subgraph of P 4. For bigenic classes of graphs, i.e. ones defined by two forbidden induced subgraphs, there are several open cases in both classifications. In the present paper we obtain a number of new results on well-quasi-orderability of bigenic classes, each of which supports the conjecture.
KeywordsWell-quasi-order Induced subgraph Hereditary graph class Bigenic class
- 11.Dabrowski, K.K., Huang, S., Paulusma, D.: Bounding clique-width via perfect graphs. Journal of Computer and System Sciences, (in press)Google Scholar
- 12.Dabrowski, K.K., Lozin, V.V., Paulusma, D.: Well-quasi-ordering versus clique-width: New results on bigenic classes. Proc. IWOCA 2016, LNCS 9843, 253–265 (2016)Google Scholar
- 13.Dabrowski, K.K., Lozin, V.V., Paulusma, D.: Clique-Width and Well-Quasi Ordering of Triangle-Free Graph Classes. Proceedings WG 2017 LNCS, (to appear)Google Scholar
Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.