Bounding the Clique-Width of $H$-free Split Graphs
Discrete Mathematics
2015-09-16 v1 Combinatorics
Abstract
A graph is -free if it has no induced subgraph isomorphic to . We continue a study into the boundedness of clique-width of subclasses of perfect graphs. We identify five new classes of -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 for which the class of -free split graphs has bounded clique-width.
Keywords
Cite
@article{arxiv.1509.04273,
title = {Bounding the Clique-Width of $H$-free Split Graphs},
author = {Andreas Brandstädt and Konrad K. Dabrowski and Shenwei Huang and Daniël Paulusma},
journal= {arXiv preprint arXiv:1509.04273},
year = {2015}
}
Comments
17 pages, 5 figures. An extended abstract of this paper appeared in the proceedings of EuroComb 2015