On the linear (n-1)-arboricity of Kn(m)
摘要：
A linear k-forest of an 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 lak(G), is the minimum number of linear k-forests needed to partition the edge set E(G) of G. In the case where the lengths of paths are not restricted, we then have the linear arboricity of G, denoted by la(G). In this paper, we obtain the exact value of the linear (n1)-arboricity of any balanced complete n-partite graph Kn(m).
展开
DOI：
10.1016/j.dam.2010.04.013
被引量：
年份：
2010
通过文献互助平台发起求助，成功后即可免费获取论文全文。
请先登入
相似文献
参考文献
引证文献
辅助模式
0
引用
文献可以批量引用啦~
欢迎点我试用！
