Browsing by Author "Yen, Chih-Hung"

Now showing 1 - 2 of 2

LINEAR 2-ARBORICITY OF THE COMPLETE GRAPH
(2010-02-01)
Yen, Chih-Hung
;
Fu, Hung-Lin
;
應用數學系
;
Department of Applied Mathematics
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 la(k) (G). In this paper, we settle the cases left in determining the linear 2-arboricity of the complete graph K(n). Mainly, we prove that la(2) (K(12t+10)) = la(2) (K(12t+11)) = 9t + 8 for any t >= 0.
The linear 3-arboricity of Kn,n and Kn
(2008-09-06)
Fu, Hung-Lin
;
Huang, Kuo-Ching
;
Yen, Chih-Hung
;
應用數學系
;
Department of Applied Mathematics
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), is the least number of linear k-forests needed to decompose G. In this paper, we completely determine lak (G) when G is a balanced complete bipartite graph K-n,K-n or a complete graph K-n, and k = 3. (C) 2007 Elsevier B.V. All rights reserved.