Brandstädt, A. and Dabrowski, K.K. and Huang, S. and Paulusma, D. (2015) 'Bounding the clique-width of H-free split graphs.', Electronic notes in discrete mathematics., 49 . pp. 497-503.
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.
|Keywords:||Clique-width, Split graphs, Perfect graphs, Forbidden induced subgraph, Hereditary graph class.|
|Full text:||(AM) Accepted Manuscript|
Available under License - Creative Commons Attribution Non-commercial No Derivatives.
Download PDF (149Kb)
|Publisher Web site:||http://dx.doi.org/10.1016/j.endm.2015.06.069|
|Publisher statement:||© 2015 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:||No date available|
|Date deposited:||21 August 2015|
|Date of first online publication:||November 2015|
|Date first made open access:||12 November 2016|
Save or Share this output
|Look up in GoogleScholar|