A Strengthening of Ben Rebea's Lemma
A Strengthening of Ben Rebea's Lemma
复制标题
Ben Rebea 引理的强化
DOI：
10.1006/jctb.1993.1052
复制
发表时间：
1993
期刊：
影响因子：
--
通讯作者：
J. Fouquet
中科院分区：
文献类型：
--
作者：
J. Fouquet
本文给出了一个由A. Ben Rebea和V. Chvatal和N.无爪完美图的识别。我们证明了一个稳定数至少为4的无爪图没有同构于一个C2p+1的诱导子图，其中p？3.作为副产品，我们证明了稳定数至少为3的无爪图中的每个顶点都使得其邻域可以被两个完全图覆盖或包含一个诱导C5。
In this note we present a strengthening of a lemma due to A. Ben Rebea and used by V. Chvatal and N. Sbihi for the recognition of claw-free perfect graphs. We show that a claw-free graph with stability number at least four has no induced subgraph isomorphic to a C2p+1 with p ? 3. As a by-product we show that every vertex in a claw-free graph with stability number at least three is such that its neighbourhoodcan be covered by two complete graphs or contains an induced C5.