The Chvatal-Erdos condition for panconnectivity of triangle-free graphs

CSpace

	The Chvatal-Erdos condition for panconnectivity of triangle-free graphs
	Wei, B; Zhu, YJ
	2002-05-31
发表期刊	DISCRETE MATHEMATICS
ISSN	0012-365X
卷号	252 期号:1-3 页码:203-214
摘要	Let G be a triangle-free graph with it vertices whose independence number does not exceed its connectivity. In this paper, we prove if G is neither K-n/2,K-n/2 nor C-5, then (i) every edge of G is contained in cycles of every length i for 4 less than or equal to i less than or equal to n; (ii) any pair of distinct vertices of G is connected by paths of i vertices for any 5 less than or equal to i less than or equal to n. This generalizes a recent result by Lou (Discrete Math. 152 (1996) 253). (C) 2002 Elsevier Science B.V. All rights reserved.
关键词	connectivity independence number panconnectivity triangle-free graphs
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000176293900014
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/17595
专题	中国科学院数学与系统科学研究院
通讯作者	Wei, B
作者单位	Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Wei, B,Zhu, YJ. The Chvatal-Erdos condition for panconnectivity of triangle-free graphs[J]. DISCRETE MATHEMATICS,2002,252(1-3):203-214.
APA	Wei, B,&Zhu, YJ.(2002).The Chvatal-Erdos condition for panconnectivity of triangle-free graphs.DISCRETE MATHEMATICS,252(1-3),203-214.
MLA	Wei, B,et al."The Chvatal-Erdos condition for panconnectivity of triangle-free graphs".DISCRETE MATHEMATICS 252.1-3(2002):203-214.