Two conjectures equivalent to the perfect graph conjecture

CSpace

	Two conjectures equivalent to the perfect graph conjecture
	Xu, BG
	2002-12-06
发表期刊	DISCRETE MATHEMATICS
ISSN	0012-365X
卷号	258 期号:1-3 页码:347-351
摘要	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.
关键词	perfect graph conjecture clique
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000180486500024
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/17478
专题	中国科学院数学与系统科学研究院
通讯作者	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.