K.K. Dabrowski
Clique-width for hereditary graph classes
Dabrowski, K.K.; Johnson, M.; Paulusma, D.
Authors
Professor Matthew matthew.johnson2@durham.ac.uk
Head Of Department
Professor Daniel daniel.paulusma@durham.ac.uk
Professor
Contributors
Allan Lo
Editor
Richard Mycroft
Editor
Guillem Perarnau
Editor
Andrew Treglown
Editor
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 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 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.
Citation
Dabrowski, K., Johnson, M., & Paulusma, D. (2019). Clique-width for hereditary graph classes. https://doi.org/10.1017/9781108649094.002
Journal Article Type | Article |
---|---|
Acceptance Date | Dec 31, 2018 |
Publication Date | Jan 1, 2019 |
Deposit Date | Jan 9, 2019 |
Publicly Available Date | Jan 9, 2019 |
Journal | London Mathematical Society lecture note series |
Peer Reviewed | Peer Reviewed |
Pages | 1-56 |
DOI | https://doi.org/10.1017/9781108649094.002 |
Public URL | https://durham-repository.worktribe.com/output/1305881 |
Files
Accepted Journal Article
(621 Kb)
PDF
Copyright Statement
This material has been published in revised form in Surveys in Combinatorics 2019 edited by Allan Lo, Richard Mycroft, Guillem Perarnau & Andrew Treglown https://doi.org/10.1017/9781108649094. This version is free to view and download for private research and study only. Not for re-distribution or re-use. © Cambridge University Press
You might also like
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal
(2023)
Journal Article
Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs
(2023)
Presentation / Conference Contribution
The Complexity of Matching Games: A Survey
(2023)
Journal Article
Computing weighted subset odd cycle transversals in H-free graphs
(2022)
Journal Article
Computing subset transversals in H-free graphs
(2021)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search