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 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 . 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.
Recommendations
Cited in
(34)- Graphs of bounded cliquewidth are polynomially -bounded
- Finding matching cuts in \(H\)-free graphs
- Tree pivot-minors and linear rank-width
- Solving problems on generalized convex graphs via mim-width
- Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy
- Faster 3-coloring of small-diameter graphs
- Bounding the Mim-Width of Hereditary Graph Classes.
- Treewidth versus clique number. II: Tree-independence number
- scientific article; zbMATH DE number 1979486 (Why is no real title available?)
- Comparing width parameters on graph classes
- Hereditary graph classes: When the complexities of <scp>coloring</scp> and <scp>clique cover</scp> coincide
- On algorithmic applications of sim-width and mim-width of (H₁,H₂)-free graphs
- Recent developments on graphs of bounded clique-width
- Uncountably many minimal hereditary classes of graphs of unbounded clique-width
- Clique-width and the speed of hereditary properties
- Clique cycle-transversals in distance-hereditary graphs
- 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, K4)‐free graphs. Part 2: Bounds on treewidth
- Clique‐width: Harnessing the power of atoms
- Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
- The Weisfeiler-Leman dimension of chordal bipartite graphs without bipartite claw
- Steiner trees for hereditary graph classes: a treewidth perspective
- Critical properties of graphs of bounded clique-width
- Clique-width for graph classes closed under complementation
- A class of graphs with large rankwidth
- Partitioning \(H\)-free graphs of bounded diameter
- Contracting to a longest path in H-free graphs
- Treewidth versus clique number. I: Graph classes with a forbidden structure
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem
- Linear clique-width for hereditary classes of cographs
- Extension preservation on dense graph classes
- Bounding the mim‐width of hereditary graph classes
This page was built for publication: Clique-width for hereditary graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5149166)
