Bounding the clique-width of H-free split graphs

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.

[1]  Andreas Brandstädt,et al.  On variations of P4-sparse graphs , 2003, Discret. Appl. Math..

[2]  Andreas Brandstädt,et al.  Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time , 2002, Inf. Process. Lett..

[3]  Rajiv Raman,et al.  Colouring vertices of triangle-free graphs without forests , 2012, Discret. Math..

[4]  Vadim V. Lozin,et al.  The Clique-Width of Bipartite Graphs in Monogenic Classes , 2008, Int. J. Found. Comput. Sci..

[5]  Konrad Dabrowski,et al.  Bounding the Clique-Width of H-free Split Graphs , 2015, Electron. Notes Discret. Math..

[6]  Martin Grohe,et al.  Isomorphism Testing for Graphs of Bounded Rank Width , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[7]  Vadim V. Lozin,et al.  Recent developments on graphs of bounded clique-width , 2009, Discret. Appl. Math..

[8]  Konrad Dabrowski,et al.  Bounding the Clique‐Width of H‐Free Chordal Graphs , 2015, J. Graph Theory.

[9]  Konrad Dabrowski,et al.  Bounding Clique-Width via Perfect Graphs , 2014, LATA.

[10]  Dieter Kratsch,et al.  On the structure of (P5, gem)-free graphs , 2005, Discret. Appl. Math..

[11]  Joost Engelfriet,et al.  Clique-Width for 4-Vertex Forbidden Subgraphs , 2006, Theory of Computing Systems.

[12]  Andreas Brandstädt,et al.  Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width , 2004, Int. J. Found. Comput. Sci..

[13]  Konrad Dabrowski,et al.  Classifying the clique-width of H-free bipartite graphs , 2016, Discret. Appl. Math..

[14]  Pascal Schweitzer.  Towards an Isomorphism Dichotomy for Hereditary Graph Classes , 2017, Theory of Computing Systems.

[15]  Andreas Brandstädt,et al.  P6- and triangle-free graphs revisited: structure and bounded clique-width , 2006, Discret. Math. Theor. Comput. Sci..

[16]  Udi Rotics,et al.  Polynomial-time recognition of clique-width ≤3 graphs , 2012, Discret. Appl. Math..

[17]  Russell Merris,et al.  Split graphs , 2003, Eur. J. Comb..

[18]  Bruno Courcelle,et al.  Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..

[19]  Stefan Kratsch,et al.  Graph isomorphism for graph classes characterized by two forbidden induced subgraphs , 2012, Discret. Appl. Math..

[20]  B. Reed,et al.  Polynomial Time Recognition of Clique-Width ≤ 3 Graphs , 2000 .

[21]  Dieter Rautenbach,et al.  The tree- and clique-width of bipartite graphs in special classes , 2006, Australas. J Comb..

[22]  Johann A. Makowsky,et al.  On the Clique-Width of Graphs with Few P4's , 1999, Int. J. Found. Comput. Sci..

[23]  Udi Rotics,et al.  On the Clique-Width of Some Perfect Graph Classes , 2000, Int. J. Found. Comput. Sci..

[24]  Konrad Dabrowski,et al.  Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs , 2014, Comput. J..

[25]  Dieter Rautenbach,et al.  On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree , 2004, SIAM J. Discret. Math..

[26]  Martin Milanic,et al.  Graph classes with and without powers of bounded clique-width , 2014, Discret. Appl. Math..

[27]  Konrad Dabrowski,et al.  Colouring of graphs with Ramsey-type forbidden subgraphs , 2013, Theor. Comput. Sci..

[28]  A. M. Murray.  The strong perfect graph theorem , 2019, 100 Years of Math Milestones.

[29]  Pinar Heggernes,et al.  Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs , 2012, Discret. Appl. Math..

[30]  Vadim V. Lozin,et al.  On the Clique-Width of Graphs in Hereditary Classes , 2002, ISAAC.

[31]  Andreas Brandstädt,et al.  Chordal co-gem-free and (P5, gem)-free graphs have bounded clique-width , 2005, Discret. Appl. Math..