We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Bounding the clique-width of H-free split graphs.

Brandstädt, A. and Dabrowski, K.K. and Huang, S. and Paulusma, D. (2016) 'Bounding the clique-width of H-free split graphs.', Discrete applied mathematics., 211 . pp. 30-39.


A graph is H-free if it has no induced subgraph isomorphic to H. We continue a study into the boundedness of clique-width of subclasses of perfect graphs. We identify five new classes of H-free split graphs whose clique-width is bounded. Our main result, obtained by combining new and known results, provides a classification of all but two stubborn cases, that is, with two potential exceptions we determine all graphs H for which the class of H-free split graphs has bounded clique-width.

Item Type:Article
Full text:(AM) Accepted Manuscript
Available under License - Creative Commons Attribution Non-commercial No Derivatives.
Download PDF
Publisher Web site:
Publisher statement:© 2016 This manuscript version is made available under the CC-BY-NC-ND 4.0 license
Date accepted:06 April 2016
Date deposited:18 May 2016
Date of first online publication:06 May 2016
Date first made open access:06 May 2017

Save or Share this output

Look up in GoogleScholar