On the linear k -arboricity of K n and K n , n
摘要：
A linear k-forest of a undirected graph G is a subgraph of G whose components are paths with lengths at most k. The linear k-arboricity of G, denoted by la k( G), is the minimum number of linear k-forests needed to partition the edge set E( G) of G. In case that the lengths of paths are not restricted, we then have the linear arboricity of G, denoted by la( G). In this paper, we first prove that a conjecture by Habib and Peroche holds when G is K n or K n, n and k is not less than half the order. Secondly, I( G)=min{ k|la k( G)=la( G)} is determined for G is K n or K n, n.
展开
DOI：
10.1016/S0012-365X(01)00365-X
被引量：
年份：
2002
通过文献互助平台发起求助，成功后即可免费获取论文全文。
请先登入
相似文献
参考文献
引证文献
辅助模式
0
引用
文献可以批量引用啦~
欢迎点我试用！
