proof of chvatals conjecture on maximal stable sets and maximal     cliques in graphs

ISCAS OpenIR

	proof of chvatals conjecture on maximal stable sets and maximal cliques in graphs
	Deng XT; Li GJ; Zang WN
	2004
发表期刊	JOURNAL OF COMBINATORIAL THEORY SERIES B
ISSN	0095-8956
卷号	91 期号:2 页码:301-325
收录类别	sci ; acm ; sciencedirect
关键词	1 The Work Was Partially Supported By a Grant From The Research Grants Council Of The Hong Kong Special Administrative Region, China (Project Cityu1056/01e).
部门归属	City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China. Shandong Univ, Sch Math & Syst Sci, Jinan 250100, Peoples R China. Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China. Univ Hong Kong, Dept Math, Hong Kon
学科领域	Mathematics
语种	英语
内容类型	期刊论文
URI标识	http://ir.iscas.ac.cn/handle/311060/12902
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Deng XT,Li GJ,Zang WN. proof of chvatals conjecture on maximal stable sets and maximal cliques in graphs[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B,2004,91(2):301-325.
APA	Deng XT,Li GJ,&Zang WN.(2004).proof of chvatals conjecture on maximal stable sets and maximal cliques in graphs.JOURNAL OF COMBINATORIAL THEORY SERIES B,91(2),301-325.
MLA	Deng XT,et al."proof of chvatals conjecture on maximal stable sets and maximal cliques in graphs".JOURNAL OF COMBINATORIAL THEORY SERIES B 91.2(2004):301-325.