The Linear 2- and 4-Arboricity of Complete Bipartite Graph
摘要：
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 l a k ( G ), is the minimum number of linear k -forests needed to decompose G . In case the lengths of paths are not restricted, we then have the linear arboricity of G , denoted by l a ( G ). In this paper, the exact value of the linear 2- and 4-arboricity of complete bipartite graph K m , n for some m and n is obtained.
展开
DOI：
10.1155/2013/501701
被引量：
年份：
2013
通过文献互助平台发起求助，成功后即可免费获取论文全文。
请先登入
相似文献
参考文献
引证文献
辅助模式
0
引用
文献可以批量引用啦~
欢迎点我试用！
