Upper bounds on linear vertex-arboricity of complementary graphs

Yousef Alavi, Paul Erdös, Peter Che Bor Lam, Don Lick, Jiuqiang Liu, Jianfang Wang

Research output: Article

3 Citations (Scopus)


The linear vertex-arboricity ρ(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.

Original languageEnglish
Pages (from-to)43-48
Number of pages6
JournalUtilitas Mathematica
Publication statusPublished - dec. 1 1997


ASJC Scopus subject areas

  • Statistics and Probability
  • Statistics, Probability and Uncertainty
  • Applied Mathematics

Cite this

Alavi, Y., Erdös, P., Lam, P. C. B., Lick, D., Liu, J., & Wang, J. (1997). Upper bounds on linear vertex-arboricity of complementary graphs. Utilitas Mathematica, 52, 43-48.