On linear k-arboricity
摘要：
Let us call a linear- k-forest a graph whose connected components are chains of length at most k. The linear- k-arboricity of G (denoted la k ( G)) is the minimum number of linear k-forests which partition E( G). We study this new index in two cases: cubic graphs and complete graphs ( k = 2 or 3).
展开
DOI：
10.1016/0012-365X(84)90075-X
被引量：
年份：
1984
相似文献
参考文献
引证文献
来源期刊
Discrete Mathematics
1984/01/01
引用走势
2010
被引量：15
辅助模式
0
引用
文献可以批量引用啦~
欢迎点我试用！
