Clique-Width for Hereditary Graph Classes

Abstract

Clique-width is a well-studied graph parameter owing to its use in understanding algorithmic tractability: if the clique-width of a graph class $\mathcal{G}$ is bounded by a constant, a wide range of problems that are NP-complete in general can be shown to be polynomial-time solvable on $\mathcal{G}$. For this reason, the boundedness or unboundedness of clique-width has been investigated and determined for many graph classes. We survey these results for hereditary graph classes, which are the graph classes closed under taking induced subgraphs. We then discuss the algorithmic consequences of these results, in particular for the Colouring and Graph Isomorphism problems. We also explain a possible strong connection between results on boundedness of clique-width and on well-quasi-orderability by the induced subgraph relation for hereditary graph classes.

61 pages, 17 figures

References in corpus (4)

• Rank-width: Algorithmic and structural results
• Graph Operations on Clique-Width Bounded Graphs
• Graph classes with and without powers of bounded clique-width
• Isomorphism Testing for Graphs of Bounded Rank Width

Cited by in corpus (8)

• List $k$-Colouring $P_t$-Free Graphs: a Mim-width Perspective
• Solving Problems on Generalized Convex Graphs via Mim-Width
• (Theta, triangle)-free and (even hole, $K_4$)-free graphs. Part 2 : bounds on treewidth
• Uncountably many minimal hereditary classes of graphs of unbounded clique-width
• Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
• Maximum independent sets in (pyramid, even hole)-free graphs
• Clique-Width: Harnessing the Power of Atoms
• A class of graphs with large rankwidth