当前位置：
X-MOL 学术
›
J. Graph Theory
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Strongly perfect claw‐free graphs—A short proof
Journal of Graph Theory ( IF 0.9 ) Pub Date : 2021-01-11 , DOI: 10.1002/jgt.22659 Maria Chudnovsky 1 , Cemil Dibek 2
Journal of Graph Theory ( IF 0.9 ) Pub Date : 2021-01-11 , DOI: 10.1002/jgt.22659 Maria Chudnovsky 1 , Cemil Dibek 2
Affiliation
A graph is strongly perfect if every induced subgraph of it has a stable set that meets every maximal clique of . A graph is claw‐free if no vertex has three pairwise nonadjacent 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.
更新日期：2021-01-11
京公网安备 11010802027423号