Clique-width for hereditary graph classes

DOI10.1017/9781108649094.002zbMATH Open1476.05175arXiv1901.00335OpenAlexW2963678182MaRDI QIDQ5149166FDOQ5149166

Konrad Dabrowski, Daniël Paulusma, Matthew Johnson

Publication date: 6 February 2021

Published in: Surveys in Combinatorics 2019 (Search for Journal in Brave)

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 $calG$ 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 $calG$. 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.

Full work available at URL: https://arxiv.org/abs/1901.00335

zbMATH Keywords

induced subgraphclique-widthgraph isomorphismgraph colouringgraph containment relationhereditary graph classwidth parameterwell-quasi-orderability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)

Cited In (25)

• Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy
• Solving problems on generalized convex graphs via mim-width
• Bounding the Mim-Width of Hereditary Graph Classes.
• Treewidth versus clique number. II: Tree-independence number
• 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_1,H_2)\)-free graphs
• Uncountably many minimal hereditary classes of graphs of unbounded clique-width
• Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure
• 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
• A class of graphs with large rankwidth
• Partitioning \(H\)-free graphs of bounded diameter
• Contracting to a longest path in H-free graphs
• Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem
• Tree Pivot-Minors and Linear Rank-Width
• Faster 3-Coloring of Small-Diameter Graphs
• Bounding the mim‐width of hereditary graph classes
• Finding matching cuts in \(H\)-free graphs

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)