Linear vertex arboricity, independence number and clique cover number

CSpace > 应用数学研究所

	Linear vertex arboricity, independence number and clique cover number
	Lam, PCB ; Shiu, WC ; Sun, F ; Wang, JF ; Yan, GY
	2001
发表期刊	ARS COMBINATORIA
ISSN	0381-7032
卷号	58 页码:121-128
摘要	The linear vertex-arboricity of a graph G is defined to the minimum number of subsets into which the vertex-set G can be partitioned so that every subset induces a linear forest. In this paper, we give the upper and lower bounds for sum and product of linear vertex-arboricity with independence number and with clique cover number respectively. All of these bounds are sharp.
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000168043000010
出版者	CHARLES BABBAGE RES CTR
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/16262
专题	应用数学研究所
作者单位	1.Hong Kong Baptist Univ, Dept Math, Hong Kong, Hong Kong, Peoples R China 2.Rally Int Inc, Forest Pk, IL 60130 USA 3.Chinese Acad Sci, Inst Appl Math, Beijing, Peoples R China 4.Asia Pacific Operat Res Ctr, Beijing, Peoples R China
推荐引用方式 GB/T 7714	Lam, PCB,Shiu, WC,Sun, F,et al. Linear vertex arboricity, independence number and clique cover number[J]. ARS COMBINATORIA,2001,58:121-128.
APA	Lam, PCB,Shiu, WC,Sun, F,Wang, JF,&Yan, GY.(2001).Linear vertex arboricity, independence number and clique cover number.ARS COMBINATORIA,58,121-128.
MLA	Lam, PCB,et al."Linear vertex arboricity, independence number and clique cover number".ARS COMBINATORIA 58(2001):121-128.