The linear 3-arboricity of Kn, n and Kn

Hung-Lin Fu; Kuo Ching Huang; Chih Hung Yen

doi:10.1016/j.disc.2007.07.067

The linear 3-arboricity of Kn, n and Kn

Hung-Lin Fu, Kuo Ching Huang, Chih Hung Yen^*

^*Corresponding author for this work

應用數學系

研究成果: Article › 同行評審

11 引文斯高帕斯（Scopus）

摘要

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 la_k (G) when G is a balanced complete bipartite graph K_{n, n} or a complete graph K_n, and k = 3.

原文	English
頁（從 - 到）	3816-3823
頁數	8
期刊	Discrete Mathematics
卷	308
發行號	17
DOIs	https://doi.org/10.1016/j.disc.2007.07.067
出版狀態	Published - 6 九月 2008

存取文件

10.1016/j.disc.2007.07.067

指紋深入研究「The linear 3-arboricity of Kn, n and Kn」主題。共同形成了獨特的指紋。

引用此

@article{066cfe1fb78540f39887270b838d5c34,

title = "The linear 3-arboricity of Kn, n and Kn",

abstract = "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 lak (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 Kn, n or a complete graph Kn, and k = 3.",

keywords = "Balanced complete bipartite graph, Complete graph, Linear k-arboricity, Linear k-forest",

author = "Hung-Lin Fu and Huang, {Kuo Ching} and Yen, {Chih Hung}",

year = "2008",

month = sep,

day = "6",

doi = "10.1016/j.disc.2007.07.067",

language = "English",

volume = "308",

pages = "3816--3823",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "17",

}

TY - JOUR

T1 - The linear 3-arboricity of Kn, n and Kn

AU - Fu, Hung-Lin

AU - Huang, Kuo Ching

AU - Yen, Chih Hung

PY - 2008/9/6

Y1 - 2008/9/6

N2 - 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 lak (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 Kn, n or a complete graph Kn, and k = 3.

AB - 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 lak (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 Kn, n or a complete graph Kn, and k = 3.

KW - Balanced complete bipartite graph

KW - Complete graph

KW - Linear k-arboricity

KW - Linear k-forest

UR - http://www.scopus.com/inward/record.url?scp=44149101711&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2007.07.067

DO - 10.1016/j.disc.2007.07.067

M3 - Article

AN - SCOPUS:44149101711

VL - 308

SP - 3816

EP - 3823

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 17

ER -