Linear vertex arboricity, independence number and clique cover number

Peter Che Bor Lam; Wai Chee Shiu; Feng Sun; Jianfang Wang; Guiying Yan

Linear vertex arboricity, independence number and clique cover number

Peter Che Bor Lam, Wai Chee Shiu, Feng Sun, Jianfang Wang, Guiying Yan

Department of Mathematics

Research output: Contribution to journal › Journal article › peer-review

1 Citation (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	121-128
Number of pages	8
Journal	Ars Combinatoria
Volume	58
Publication status	Published - Jan 2001

Cite this

@article{69644fe8c9a045d9bb9974ca47b321a0,

title = "Linear vertex arboricity, independence number and clique cover number",

abstract = "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.",

author = "Lam, {Peter Che Bor} and Shiu, {Wai Chee} and Feng Sun and Jianfang Wang and Guiying Yan",

note = "Funding information: Peter Che Bor Lam and Wai Chee Shiu: work is partially supported by FRG, HKBU, and RGC Grant Hong Kong. Jianfang Wang: work is partially supported by the National Science Foundation of China and Tian Yuan Grant No. 19136014.",

year = "2001",

month = jan,

language = "English",

volume = "58",

pages = "121--128",

journal = "Ars Combinatoria",

issn = "0381-7032",

publisher = "Charles Babbage Research Centre",

}

TY - JOUR

T1 - Linear vertex arboricity, independence number and clique cover number

AU - Lam, Peter Che Bor

AU - Shiu, Wai Chee

AU - Sun, Feng

AU - Wang, Jianfang

AU - Yan, Guiying

N1 - Funding information: Peter Che Bor Lam and Wai Chee Shiu: work is partially supported by FRG, HKBU, and RGC Grant Hong Kong. Jianfang Wang: work is partially supported by the National Science Foundation of China and Tian Yuan Grant No. 19136014.

PY - 2001/1

Y1 - 2001/1

N2 - 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.

AB - 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.

UR - https://combinatorialpress.com/ars/arch/vol58/

UR - http://www.scopus.com/inward/record.url?scp=0039190148&partnerID=8YFLogxK

M3 - Journal article

AN - SCOPUS:0039190148

SN - 0381-7032

VL - 58

SP - 121

EP - 128

JO - Ars Combinatoria

JF - Ars Combinatoria

ER -

Linear vertex arboricity, independence number and clique cover number

Abstract

Other files and links

Fingerprint

Cite this