Title of article
The linear 3-arboricity of image and image Original Research Article
Author/Authors
Hung-Lin Fu، نويسنده , , Kuo-Ching Huang، نويسنده , , Chih-Hung Yen، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
8
From page
3816
To page
3823
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 image, is the least number of linear k-forests needed to decompose G. In this paper, we completely determine image when G is a balanced complete bipartite graph image or a complete graph image, and image.
Keywords
Linear k-arboricity , Complete graph , Balanced complete bipartite graph , Linear k-forest
Journal title
Discrete Mathematics
Serial Year
2008
Journal title
Discrete Mathematics
Record number
946991
Link To Document