Strongly perfect claw-free graphs - a short proof.

Citation:

M. Chudnovsky and C. Dibek, “Strongly perfect claw-free graphs - a short proof.” to appear in Journal of Graph Theory, 2020.

Abstract:

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 neighbors. The characterization of claw-free graphs that are strongly perfect by a set of forbidden induced subgraphs was conjectured by Ravindra in 1990 and was proved by Wang in 2006. Here we give a shorter proof of this characterization.

[arXiv]

Last updated on 12/14/2020