The linear 3-arboricity of Kn,n and Kn

檔案

日期

2008-09-06

類型

期刊名稱

DISCRETE MATHEMATICS

卷期與頁次

第 308 卷第 17 期,頁 3816–3823

ISSN

0012-365X

語言

英文

摘要

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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Fu, H.-L., Huang, K.-C., & Yen, C.-H. (2008). The linear 3-arboricity of Kn,n and Kn. DISCRETE MATHEMATICS, 308(17), 3816–3823. https://doi.org/10.1016/j.disc.2007.07.067

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/8365