Connected factors in K-1,K-n-free graphs containing a (g,f)-factor

CSpace

	Connected factors in K-1,K-n-free graphs containing a (g,f)-factor
	Xu, BG ; Liu, ZH ; Tokuda, T
	1998
发表期刊	GRAPHS AND COMBINATORICS
ISSN	0911-0119
卷号	14 期号:4 页码:393-395
摘要	Let G be a connected K-1,K-n-free graph (n greater than or equal to 3), f and g be positive integer-valued functions defined on V(G) with g(v) less than or equal to f(v) for all v is an element of V(G). We prove that G contains a connected (g, f + n - 1)-factor if G has a (g, f)-factor. This result is sharp from the point of view that there exists a connected K-1,K-n-free graph which has a (g,f)-factor but no connected (g, f + n - 2)-factor for all pairs of positive integer-valued functions g and f with g = f.
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000077629300008
出版者	SPRINGER VERLAG
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/13809
专题	中国科学院数学与系统科学研究院
作者单位	1.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China 2.Keio Univ, Fac Sci & Technol, Dept Math, Kohoku Ku, Yokohama, Kanagawa 2238522, Japan
推荐引用方式 GB/T 7714	Xu, BG,Liu, ZH,Tokuda, T. Connected factors in K-1,K-n-free graphs containing a (g,f)-factor[J]. GRAPHS AND COMBINATORICS,1998,14(4):393-395.
APA	Xu, BG,Liu, ZH,&Tokuda, T.(1998).Connected factors in K-1,K-n-free graphs containing a (g,f)-factor.GRAPHS AND COMBINATORICS,14(4),393-395.
MLA	Xu, BG,et al."Connected factors in K-1,K-n-free graphs containing a (g,f)-factor".GRAPHS AND COMBINATORICS 14.4(1998):393-395.