Strongly Perfect Claw-free Graphs -- A Short Proof
Combinatorics
2020-11-10 v2
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.
Keywords
Cite
@article{arxiv.1912.05645,
title = {Strongly Perfect Claw-free Graphs -- A Short Proof},
author = {Maria Chudnovsky and Cemil Dibek},
journal= {arXiv preprint arXiv:1912.05645},
year = {2020}
}