The linear 3-arboricity of Kn, n and Kn

Hung-Lin Fu, Kuo Ching Huang, Chih Hung Yen*

*Corresponding author for this work

Research output: Contribution to journalArticle

9 Scopus citations

Abstract

A linear k-forest is a forest whose components are paths of length at most k. The linear k-arboricity of a graph G, denoted by lak (G), is the least number of linear k-forests needed to decompose G. In this paper, we completely determine lak (G) when G is a balanced complete bipartite graph Kn, n or a complete graph Kn, and k = 3.

Original languageEnglish
Pages (from-to)3816-3823
Number of pages8
JournalDiscrete Mathematics
Volume308
Issue number17
DOIs
StatePublished - 6 Sep 2008

Keywords

  • Balanced complete bipartite graph
  • Complete graph
  • Linear k-arboricity
  • Linear k-forest

Fingerprint Dive into the research topics of 'The linear 3-arboricity of Kn, n and Kn'. Together they form a unique fingerprint.

  • Cite this

    Fu, H-L., Huang, K. C., & Yen, C. H. (2008). The linear 3-arboricity of Kn, n and Kn. Discrete Mathematics, 308(17), 3816-3823. https://doi.org/10.1016/j.disc.2007.07.067