Panconnectivity of locally connected claw-free graphs

CSpace

	Panconnectivity of locally connected claw-free graphs
	Sheng, Y; Tian, F; Wei, B
	1999-05-28
发表期刊	DISCRETE MATHEMATICS
ISSN	0012-365X
卷号	203 期号:1-3 页码:253-260
摘要	Let G be a connected, locally connected, claw-free graph and x, y be two vertices of G. In this paper, we prove that if for any 2-cut S of G, S boolean AND {x, y} = 0, then G contains (x, y)-paths of all possible lengths. As a corollary of the result, the following conjecture of Broersma and Veldman is proved: every locally connected, claw-free graph of order at least 4 is panconnected if and only if it is 3-connected. (C) 1999 Elsevier Science B.V. All rights reserved.
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000081017800019
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/14598
专题	中国科学院数学与系统科学研究院
作者单位	Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Sheng, Y,Tian, F,Wei, B. Panconnectivity of locally connected claw-free graphs[J]. DISCRETE MATHEMATICS,1999,203(1-3):253-260.
APA	Sheng, Y,Tian, F,&Wei, B.(1999).Panconnectivity of locally connected claw-free graphs.DISCRETE MATHEMATICS,203(1-3),253-260.
MLA	Sheng, Y,et al."Panconnectivity of locally connected claw-free graphs".DISCRETE MATHEMATICS 203.1-3(1999):253-260.