Two conjectures equivalent to the perfect graph conjecture
文献类型：期刊论文
| 作者 | Xu, BG |
| 刊名 | DISCRETE MATHEMATICS
 |
| 出版日期 | 2002-12-06 |
| 卷号 | 258期号:1-3页码:347-351 |
| 关键词 | perfect graph conjecture clique |
| ISSN号 | 0012-365X |
| 英文摘要 | In this note, we study the graphs with the property that each of their induced subgraphs has circular clique number (defined in Section 2) the same as its clique number, prove that a graph satisfies such a property if and only if neither itself nor its complement contains an induced subgraph isomorphic to an odd cycle of length at least five, and then give two conjectures which are equivalent to the perfect graph conjecture. (C) 2002 Elsevier Science B.V. All rights reserved. |
| 语种 | 英语 |
| WOS记录号 | WOS:000180486500024 |
| 出版者 | ELSEVIER SCIENCE BV |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/17477]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Xu, BG |
| 作者单位 | 1.Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China 2.Nanjing Normal Univ, Sch Math & Comp Sci, Nanjing 210097, Peoples R China |
| 推荐引用方式 GB/T 7714 | Xu, BG. Two conjectures equivalent to the perfect graph conjecture[J]. DISCRETE MATHEMATICS,2002,258(1-3):347-351. |
| APA | Xu, BG.(2002).Two conjectures equivalent to the perfect graph conjecture.DISCRETE MATHEMATICS,258(1-3),347-351. |
| MLA | Xu, BG."Two conjectures equivalent to the perfect graph conjecture".DISCRETE MATHEMATICS 258.1-3(2002):347-351. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。