Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes
Daligault, Rao and Thomassé conjectured that if a hereditary class of graphs is well-quasi-ordered by the induced subgraph relation then it has bounded clique-width. Lozin, Razgon and Zamaraev recently showed that this conjecture is not true for infinitely defined classes. For finitely defined classes the conjecture is still open. It 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. We reduce the number of open cases for well-quasi-orderability of such classes from 12 to 9. Our results agree with the conjecture and imply that there are only two remaining cases to verify for bigenic classes.
- 10.Dabrowski, K.K., Dross, F., Paulusma, D.: Colouring diamond-free graphs. In: Pagh, R. (ed.) SWAT 2016. LIPIcs, vol 53, pp. 16:1–16:14. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl (2016)Google Scholar
- 11.Dabrowski, K.K., Huang, S., Paulusma, D.: Bounding clique-width via perfect graphs. J. Comput. Syst. Sci. (2016, in press). doi:10.1016/j.jcss.2016.06.007
- 21.Lozin, V.V., Razgon, I., Zamaraev, V.: Well-quasi-ordering does not imply bounded clique-width. In: Proceedings of WG 2015. LNCS, vol. 9224 (2015, to appear)Google Scholar