Linear 2-arboricity of the complete graph

Chih Hung Yen*, Hung-Lin Fu

*Corresponding author for this work

研究成果: Article同行評審

8 引文 斯高帕斯(Scopus)

摘要

A linear k-forest is a graph whose components are paths with lengths at most k. The minimum number of linear k-forests needed to decompose a graph G is the linear k-arboricity of G and denoted by lak(G). In this paper, we settle the cases left in determining the linear 2-arboricity of the complete graph Kn. Mainly, we prove that la2(K12t+10) = la2(K12t+11) = 9t + 8 for any t ≥ 0.

原文English
頁(從 - 到)273-286
頁數14
期刊Taiwanese Journal of Mathematics
14
發行號1
DOIs
出版狀態Published - 1 一月 2010

指紋 深入研究「Linear 2-arboricity of the complete graph」主題。共同形成了獨特的指紋。

引用此