Dabrowski, K.K. and Huang, S. and Paulusma, D. (2019) 'Bounding clique-width via perfect graphs.', Journal of computer and system sciences., 104 . pp. 202-215.
We continue the study into the clique-width of graph classes defined by two forbidden induced graphs. We present three new classes of bounded clique-width and one of unbounded clique-width. The four new graph classes have in common that one of their two forbidden induced subgraphs is the diamond. To prove boundedness of clique-width for the first three cases we develop a technique based on bounding clique covering number in combination with reduction to subclasses of perfect graphs. We extend our proof of unboundedness for the fourth case to show that Graph Isomorphism is Graph Isomorphism-complete on the same graph class.
|Full text:||(AM) Accepted Manuscript|
Available under License - Creative Commons Attribution Non-commercial No Derivatives.
Download PDF (500Kb)
|Publisher Web site:||https://doi.org/10.1016/j.jcss.2016.06.007|
|Publisher statement:||© 2016 This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/|
|Date accepted:||24 June 2016|
|Date deposited:||07 July 2016|
|Date of first online publication:||12 July 2016|
|Date first made open access:||12 July 2017|
Save or Share this output
|Look up in GoogleScholar|