Plane graphs with acyclic complex

CSpace

	Plane graphs with acyclic complex
	Xu, BG
	2001
发表期刊	COMPUTING AND COMBINATORICS
ISSN	0302-9743
卷号	2108 页码:395-399
摘要	All vertex-sets of cliques of G form the simplexes of an abstract complex C(G), which is called the clique complex of G. It is proved that the clique complex of a plane graph G is acyclic if and only if G is contractible.
语种	英语
WOS研究方向	Computer Science
WOS类目	Computer Science, Theory & Methods
WOS记录号	WOS:000179960000044
出版者	SPRINGER-VERLAG BERLIN
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/16202
专题	中国科学院数学与系统科学研究院
通讯作者	Xu, BG
作者单位	Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Xu, BG. Plane graphs with acyclic complex[J]. COMPUTING AND COMBINATORICS,2001,2108:395-399.
APA	Xu, BG.(2001).Plane graphs with acyclic complex.COMPUTING AND COMBINATORICS,2108,395-399.
MLA	Xu, BG."Plane graphs with acyclic complex".COMPUTING AND COMBINATORICS 2108(2001):395-399.