Publication detailsDabrowski, K.K., Huang, S. & Paulusma, D. (2019). Bounding clique-width via perfect graphs. Journal of Computer and System Sciences 104: 202-215.
- Publication type: Journal Article
- ISSN/ISBN: 0022-0000
- DOI: 10.1016/j.jcss.2016.06.007
- Further publication details on publisher web site
- Durham Research Online (DRO) - may include full text
Author(s) from Durham
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.