Log In Sign Up

Clique-Width: Harnessing the Power of Atoms

by   Konrad K. Dabrowski, et al.

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


Graph Isomorphism for (H_1,H_2)-free Graphs: An Almost Complete Dichotomy

We consider the Graph Isomorphism problem for classes of graphs characte...

Bounding the Mim-Width of Hereditary Graph Classes

A large number of NP-hard graph problems become polynomial-time solvable...

Clique-Width for Hereditary Graph Classes

Clique-width is a well-studied graph parameter owing to its use in under...

On the Clique-Width of Unigraphs

Clique-width is a well-studied graph parameter. For graphs of bounded cl...

Clique-width and Well-Quasi-Ordering of Triangle-Free Graph Classes

Daligault, Rao and Thomassé asked whether every hereditary graph class t...

A unified algorithm for colouring graphs of bounded clique-width

Clique-width is one of the graph complexity measures leading to polynomi...

Colouring Square-Free Graphs without Long Induced Paths

The complexity of Colouring is fully understood for H-free graphs, but ...