6 citations · 13 across the 7 of their papers we have counts for
Showing 2015 · cs.DMShow all
2 papers · 2 filters
cs.DM2015
Bounding the Clique-Width of -free Split Graphs
Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang +1
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…
cs.DM2015★ 6 cited
Bounding the Clique-Width of -free Chordal Graphs
Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang +1
A graph is -free if it has no induced subgraph isomorphic to . Brandstädt, Engelfriet, Le and Lozin proved that the class of chordal graphs with independence number at most 3…