23 citations · 59 across the 29 of their papers we have counts for
6 papers · 1 filter
Structure and algorithms for (cap, even hole)-free graphs
Kathie Cameron, Murilo V. G. da Silva, Shenwei Huang +1
A graph is even-hole-free if it has no induced even cycles of length 4 or more. A cap is a cycle of length at least 5 with exactly one chord and that chord creates a triangle with…
A note on coloring (even-hole,cap)-free graphs
Shenwei Huang, Murilo V. G. da Silva
A {\em hole} is a chordless cycle of length at least four. A hole is {\em even} (resp. {\em odd}) if it contains an even (resp. odd) number of vertices. A \emph{cap} is a graph ind…
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…
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…
Bounding Clique-Width via Perfect Graphs
Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
Given two graphs and , a graph is -free if it contains no subgraph isomorphic to or . We continue a recent study into the clique-width of $(H_1…
Complexity of Coloring Graphs without Paths and Cycles
Pavol Hell, Shenwei Huang
Let and denote a path on vertices and a cycle on vertices, respectively. In this paper we study the -coloring problem for -free graphs. M…