The linear 3-arboricity of Kn,n and Kn
檔案
- 000257303500007.pdf (179.0 KB, Adobe PDF)
日期
2008-09-06
類型
系所
期刊名稱
DISCRETE MATHEMATICS
卷期與頁次
第 308 卷第 17 期,頁 3816–3823
ISSN
0012-365X
語言
英文
摘要
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 la(k) (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 K-n,K-n or a complete graph K-n, and k = 3. (C) 2007 Elsevier B.V. All rights reserved.