Bounding clique-width via perfect graphs

Dabrowski, K.K.; Huang, S.; Paulusma, D.

Abstract

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.

Citation

Dabrowski, K., Huang, S., & Paulusma, D. (2019). Bounding clique-width via perfect graphs. Journal of Computer and System Sciences, 104, 202-215. https://doi.org/10.1016/j.jcss.2016.06.007

• Journal Article Type: Article
• Acceptance Date: Jun 24, 2016
• Online Publication Date: Jul 12, 2016
• Publication Date: Sep 30, 2019
• Deposit Date: Jul 6, 2016
• Publicly Available Date: Jul 12, 2017
• Journal: Journal of Computer and System Sciences
• Print ISSN: 0022-0000
• Electronic ISSN: 1090-2724
• Publisher: Elsevier
• Peer Reviewed: Peer Reviewed
• Volume: 104
• Pages: 202-215
• DOI: https://doi.org/10.1016/j.jcss.2016.06.007
• Public URL: https://durham-repository.worktribe.com/output/1401076