An Ore-type condition for pancyclability

CSpace

	An Ore-type condition for pancyclability
	Favaron, O ; Flandrin, E ; Li, H ; Tian, F
	1999-08-28
发表期刊	DISCRETE MATHEMATICS
ISSN	0012-365X
卷号	206 期号:1-3 页码:139-144
摘要	Let G be a graph of order n and S a subset of V(G). We define G to be S-pancyclable if for every integer l, 3 less than or equal to l less than or equal to \S\, there exists a cycle in G that contains exactly I vertices of S. We prove that if the degree sum in G of every pair of nonadjacent vertices of S is at least n, then G is either S-pancyclable or else n is even, S = V(G) and G = K-n/2,K-n/2, or \S\ = 4, G[S] = K-2,K-2, and the structure of G is well characterized. (C) 1999 Elsevier Science B.V. All rights reserved.
关键词	graph pancyclic cyclable
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000082183600013
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/14124
专题	中国科学院数学与系统科学研究院
作者单位	1.Univ Paris Sud, LRI, F-91405 Orsay, France 2.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Favaron, O,Flandrin, E,Li, H,et al. An Ore-type condition for pancyclability[J]. DISCRETE MATHEMATICS,1999,206(1-3):139-144.
APA	Favaron, O,Flandrin, E,Li, H,&Tian, F.(1999).An Ore-type condition for pancyclability.DISCRETE MATHEMATICS,206(1-3),139-144.
MLA	Favaron, O,et al."An Ore-type condition for pancyclability".DISCRETE MATHEMATICS 206.1-3(1999):139-144.