A new result on Alspach's problem

CSpace > 应用数学研究所

	A new result on Alspach's problem
	Yan, GY
	1999
发表期刊	GRAPHS AND COMBINATORICS
ISSN	0911-0119
卷号	15 期号:3 页码:365-371
摘要	Let G be a simple graph. Let g(x) and f(x) be integer-valued functions defined on V(G) with g(x) greater than or equal to 2 and f(x) greater than or equal to 5 for all x is an element of V(G). It is proved that if G is an (mg + m - 1, mf - m + 1)-graph and H is a subgraph of G with m edges, then there exists a (g,f)-factorization of G orthogonal to H.
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000087242700012
出版者	SPRINGER VERLAG
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/14319
专题	应用数学研究所
通讯作者	Yan, GY
作者单位	Acad Sinica, Inst Appl Math, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Yan, GY. A new result on Alspach's problem[J]. GRAPHS AND COMBINATORICS,1999,15(3):365-371.
APA	Yan, GY.(1999).A new result on Alspach's problem.GRAPHS AND COMBINATORICS,15(3),365-371.
MLA	Yan, GY."A new result on Alspach's problem".GRAPHS AND COMBINATORICS 15.3(1999):365-371.