Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs

Atminas, A.; Brignall, R.; Lozin, V. and Stacho, J. (2021). Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs. Discrete Applied Mathematics, 295 pp. 57–69.

DOI: https://doi.org/10.1016/j.dam.2021.02.007

Abstract

We discover new hereditary classes of graphs that are minimal (with respect to set inclusion) of unbounded clique-width. The new examples include split permutation graphs and bichain graphs. Each of these classes is characterised by a finite list of minimal forbidden induced subgraphs. These, therefore, disprove a conjecture due to Daligault, Rao and Thomassé from 2010 claiming that all such minimal classes must be defined by infinitely many forbidden induced subgraphs. In the same paper, Daligault, Rao and Thomassé make another conjecture that every hereditary class of unbounded clique-width must contain a labelled infinite antichain. We show that the two example classes we consider here satisfy this conjecture. Indeed, they each contain a canonical labelled infinite antichain, which leads us to propose a stronger conjecture: that every hereditary class of graphs that is minimal of unbounded clique-width contains a canonical labelled infinite antichain.

Viewing alternatives

Metrics

Item Actions

Export

You can export this page using these formats Digital Object Identifier - DOI