| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649527 | Discrete Mathematics | 2008 | 8 Pages |
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)lak(G), is the least number of linear k-forests needed to decompose G . In this paper, we completely determine lak(G)lak(G) when G is a balanced complete bipartite graph Kn,nKn,n or a complete graph KnKn, and k=3k=3.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Hung-Lin Fu, Kuo-Ching Huang, Chih-Hung Yen,