Bounded Clique-Width of ($S_{1,2,2}$,Triangle)-Free Graphs

Andreas Brandstadt, Suhail Mahfud, Raffaele Mosca

If a graph has no induced subgraph isomorphic to $H_1$ or $H_2$ then it is said to be ($H_1,H_2$)-free. Dabrowski and Paulusma found 13 open cases for the question whether the cliq…