標題: The linear 3-arboricity of Kn,n and Kn
作者: Fu, Hung-Lin
Huang, Kuo-Ching
Yen, Chih-Hung
應用數學系
Department of Applied Mathematics
關鍵字: linear k-forest;linear k-arboricity;balanced complete bipartite graph;complete graph
公開日期: 6-九月-2008
摘要: 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.
URI: http://dx.doi.org/10.1016/j.disc.2007.07.067
http://hdl.handle.net/11536/8365
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.07.067
期刊: DISCRETE MATHEMATICS
Volume: 308
Issue: 17
起始頁: 3816
結束頁: 3823
顯示於類別:期刊論文


文件中的檔案:

  1. 000257303500007.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。