The linear 3-arboricity of K n , n and K n
摘要：
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) la k ( G ) mathContainer Loading Mathjax , is the least number of linear k -forests needed to decompose G . In this paper, we completely determine la k (G) la k ( G ) mathContainer Loading Mathjax when G is a balanced complete bipartite graph K n,n K n , n mathContainer Loading Mathjax or a complete graph K n K n mathContainer Loading Mathjax , and k=3 k = 3 mathContainer Loading Mathjax .
展开
被引量：
年份：
2008
Elsevier
(全网免费下载)
Semantic Scholar
(全网免费下载)
ResearchGate
(全网免费下载)
core.ac.uk
(全网免费下载)
ir.lib.nctu.edu.tw
(全网免费下载)
math.nctu.edu.tw
(全网免费下载)
140.113.37.243
(全网免费下载)
ir.nctu.edu.tw
(全网免费下载)
通过文献互助平台发起求助，成功后即可免费获取论文全文。
请先登入
相似文献
参考文献
引证文献
辅助模式
0
引用
文献可以批量引用啦~
欢迎点我试用！
