The linear 3-arboricity of Kn, n and Kn

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

*Corresponding author for this work

研究成果: Article同行評審

9 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)3816-3823
頁數8
期刊Discrete Mathematics
308
發行號17
DOIs
出版狀態Published - 6 九月 2008

指紋 深入研究「The linear 3-arboricity of Kn, n and Kn」主題。共同形成了獨特的指紋。

引用此