Long cycles through a linear forest

CSpace

	Long cycles through a linear forest
	Hu, ZQ ; Tian, F ; Wei, B
	2001-05-01
发表期刊	JOURNAL OF COMBINATORIAL THEORY SERIES B
ISSN	0095-8956
卷号	82 期号:1 页码:67-80
摘要	For a graph G and an integer k greater than or equal to1, let S(G)={x is an element ofV(G): d(G)(x)=0} and sigma (k)(G)=min{Sigma (k)(i=1) d(G)(v(i)) : {v(1),v(2),..., v(k)} is an independent set of G}. The main result of this paper is as follows. Let k greater than or equal to 3, m greater than or equal to 0, and 0 less than or equal to s less than or equal to k - 3. Let G be a (m + k - 1)-connected graph and let F be a subgraph of G with \E(F)\ = m and \S(F)\=s. If every component of F is a path, then G has a cycle of length greater than or equal to min {\V(G)\, 2/k sigma (k)(G)-m} passing through E(F) boolean OR V(F). This generalizes three related results known previously. (C) 2001 Academic Press.
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000168780300006
出版者	ACADEMIC PRESS INC
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/16849
专题	中国科学院数学与系统科学研究院
通讯作者	Hu, ZQ
作者单位	1.Cent China Normal Univ, Dept Math, Wuhan 430079, Peoples R China 2.Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Hu, ZQ,Tian, F,Wei, B. Long cycles through a linear forest[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B,2001,82(1):67-80.
APA	Hu, ZQ,Tian, F,&Wei, B.(2001).Long cycles through a linear forest.JOURNAL OF COMBINATORIAL THEORY SERIES B,82(1),67-80.
MLA	Hu, ZQ,et al."Long cycles through a linear forest".JOURNAL OF COMBINATORIAL THEORY SERIES B 82.1(2001):67-80.