Connected factors and spanning trees in graphs

	Connected factors and spanning trees in graphs
	Tokuda, T; Xu, BG; Wang, JF
发表期刊	GRAPHS AND COMBINATORICS
关键词	Connected Factor Factor-tree Spanning Tree
摘要	Let G be a graph, and g, f, f' be positive integer-valued functions defined on V(G). If an f'-factor of G is a spanning tree, we say that it is f'-tree. In this paper, it is shown that G contains a connected (g, f+f'-1)-factor if G has a (g, f)-factor and an f'-tree.
	2003
卷号	19 期号:2 页码:4,259-262
ISSN	0911-0119
学科领域	Mathematics
收录类别	SCI
语种	英语
WOS记录号	WOS:000183584100010
引用统计	被引频次：3[WOS] [WOS记录] [WOS相关记录]
文献类型	期刊论文
条目标识符	http://ir.casisd.cn/handle/190111/5301
专题	中国科学院科技政策与管理科学研究所(1985年6月-2015年12月) 系统分析与管理研究所
推荐引用方式 GB/T 7714	Tokuda, T,Xu, BG,Wang, JF. Connected factors and spanning trees in graphs[J]. GRAPHS AND COMBINATORICS,2003,19(2):4,259-262.
APA	Tokuda, T,Xu, BG,&Wang, JF.(2003).Connected factors and spanning trees in graphs.GRAPHS AND COMBINATORICS,19(2),4,259-262.
MLA	Tokuda, T,et al."Connected factors and spanning trees in graphs".GRAPHS AND COMBINATORICS 19.2(2003):4,259-262.