12 citations · 21 across the 8 of their papers we have counts for
1 paper · 1 filter
Maria Chudnovsky, Cemil Dibek
A graph is strongly perfect if every induced subgraph H has a stable set that meets every maximal clique of H. A graph is claw-free if no vertex has three pairwise non-adjacent nei…