Upper bounds on linear vertex-arboricity of complementary graphs

	Upper bounds on linear vertex-arboricity of complementary graphs
	Alavi, Y ; Erdos, P ; Lam, PCB ; Lick, D ; Liu, JQ ; Wang, JF
刊名	UTILITAS MATHEMATICA
	1997-12-01
卷号	52 页码:43-48
ISSN号	0315-3681
英文摘要	The linear vertex-arboricity rho(G) of a gragh G is defined to be the minimum number of subsets into which the vertex set of G can be partitioned such that each subset induces a linear forest. Alavi et.al. [1] gave sharp upper and lower bounds for the sum and product of linear vertex-arboricity of a graph and its complement. In this paper we give an improved upper bound for that sum.
WOS研究方向	Mathematics
语种	英语
出版者	UTIL MATH PUBL INC
WOS记录号	WOS:000072024800003
内容类型	期刊论文
源URL	[http://ir.amss.ac.cn/handle/2S8OKBNM/13211]
专题	中国科学院数学与系统科学研究院
作者单位	1.Western Michigan Univ, Kalamazoo, MI 49008 USA 2.Eastern Michigan Univ, Ypsilanti, MI 48197 USA 3.Chinese Acad Sci, Inst Appl Math, Beijing 100864, Peoples R China 4.Hungarian Acad Sci, H-1051 Budapest, Hungary
推荐引用方式 GB/T 7714	Alavi, Y,Erdos, P,Lam, PCB,et al. Upper bounds on linear vertex-arboricity of complementary graphs[J]. UTILITAS MATHEMATICA,1997,52:43-48.
APA	Alavi, Y,Erdos, P,Lam, PCB,Lick, D,Liu, JQ,&Wang, JF.(1997).Upper bounds on linear vertex-arboricity of complementary graphs.UTILITAS MATHEMATICA,52,43-48.
MLA	Alavi, Y,et al."Upper bounds on linear vertex-arboricity of complementary graphs".UTILITAS MATHEMATICA 52(1997):43-48.