A degree condition for a graph to have [a,b]-factors

CSpace

	A degree condition for a graph to have [a,b]-factors
	Li, YJ; Cai, MC
	1998
发表期刊	JOURNAL OF GRAPH THEORY
ISSN	0364-9024
卷号	27 期号:1 页码:1-6
摘要	Let G be a graph of order n, and let a and b be integers such that 1 less than or equal to a < b. We show that G has an [a,b]-factor if delta(G) greater than or equal to a, n greater than or equal to 2a + b + a2 - a/b and max{d(G)(u), d(G)(v)} greater than or equal to an/a + b for any two nonadjacent vertices u and v in G. This result is best possible, and it is an extension of T. lida and T. Nishimura's results (T. lida and T. Nishimura, An Ore-type condition for the existence of k-factors in graphs, Graphs and Combinat. 7 (1991), 353-361; T. Nishimura, A degree condition for the existence of Ic-factors, J. Graph Theory 16 (1992), 141-151). about the existence of a k-factor. As an immediate consequence, it shows that a conjecture of M. Kano (M. Kano, Some current results and problems on factors of graphs, Proc. 3rd China-USA International Conference on Graph Theory and Its Application, Beijing (1993). about connected [a, b]-factors is incorrect. (C) 1998 John Wiley & Sons, Inc.
关键词	degree condition [a,b]-factor connected factor
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000071323300001
出版者	JOHN WILEY & SONS INC
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/13722
专题	中国科学院数学与系统科学研究院
通讯作者	Li, YJ
作者单位	Chinese Acad Sci, Inst Syst Sci, Beijing, Peoples R China
推荐引用方式 GB/T 7714	Li, YJ,Cai, MC. A degree condition for a graph to have [a,b]-factors[J]. JOURNAL OF GRAPH THEORY,1998,27(1):1-6.
APA	Li, YJ,&Cai, MC.(1998).A degree condition for a graph to have [a,b]-factors.JOURNAL OF GRAPH THEORY,27(1),1-6.
MLA	Li, YJ,et al."A degree condition for a graph to have [a,b]-factors".JOURNAL OF GRAPH THEORY 27.1(1998):1-6.