Connected factors and spanning trees in graphs

CSpace

	Connected factors and spanning trees in graphs
	Tokuda, T ; Xu, BG ; Wang, JF
	2003
发表期刊	GRAPHS AND COMBINATORICS
ISSN	0911-0119
卷号	19 期号:2 页码:259-262
摘要	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.
关键词	connected factor factor-tree spanning tree
DOI	10.1007/s00373-002-0497-5
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000183584100010
出版者	SPRINGER-VERLAG TOKYO
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/18879
专题	中国科学院数学与系统科学研究院
通讯作者	Tokuda, T
作者单位	1.Tokyo Denki Univ, Coll Sci & Engn, Dept Informat Sci, Hatoyama, Saitama 3500394, Japan 2.Chinese Acad Sci, Inst Policy & Management, Beijing 100080, Peoples R China 3.Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Tokuda, T,Xu, BG,Wang, JF. Connected factors and spanning trees in graphs[J]. GRAPHS AND COMBINATORICS,2003,19(2):259-262.
APA	Tokuda, T,Xu, BG,&Wang, JF.(2003).Connected factors and spanning trees in graphs.GRAPHS AND COMBINATORICS,19(2),259-262.
MLA	Tokuda, T,et al."Connected factors and spanning trees in graphs".GRAPHS AND COMBINATORICS 19.2(2003):259-262.