Clique-Width for Hereditary Graph Classes release_hfzotzs2xvexfosgyd2h47djce

by Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma

Released as a article .

2019  

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.
In text/plain format

Archived Files and Locations

application/pdf  715.0 kB
file_ukxw4qklm5gfjkyfygmroxjnwm
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2019-01-02
Version   v1
Language   en ?
arXiv  1901.00335v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 77008aa7-8091-46c7-88bb-77e378be84bc
API URL: JSON