4 research outputs found

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

    Full text link
    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 Thomasse from 2010 claiming that all such minimal classes must be defined by infinitely many forbidden induced subgraphs. In the same paper, Daligault, Rao and Thomasse 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.Comment: 17 pages, 7 figure

    Clique‐width: Harnessing the power of atoms

    Get PDF
    Many NP-complete graph problems are polynomial-time solvable on graph classes of bounded clique-width. Several of these problems are polynomial-time solvable on a hereditary graph class if they are so on the atoms (graphs with no clique cut-set) of . Hence, we initiate a systematic study into boundedness of clique-width of atoms of hereditary graph classes. A graph is -free if is not an induced subgraph of , and it is -free if it is both -free and -free. A class of -free graphs has bounded clique-width if and only if its atoms have this property. This is no longer true for -free graphs, as evidenced by one known example. We prove the existence of another such pair and classify the boundedness of clique-width on -free atoms for all but 18 cases
    corecore