摘要
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 |