The linear 3-arboricity of Kn,n and Kn

Full metadata record

DC Field	Value	Language
dc.contributor.author	Fu, Hung-Lin	en_US
dc.contributor.author	Huang, Kuo-Ching	en_US
dc.contributor.author	Yen, Chih-Hung	en_US
dc.date.accessioned	2014-12-08T15:10:56Z	-
dc.date.available	2014-12-08T15:10:56Z	-
dc.date.issued	2008-09-06	en_US
dc.identifier.issn	0012-365X	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/j.disc.2007.07.067	en_US
dc.identifier.uri	http://hdl.handle.net/11536/8365	-
dc.description.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 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.	en_US
dc.language.iso	en_US	en_US
dc.subject	linear k-forest	en_US
dc.subject	linear k-arboricity	en_US
dc.subject	balanced complete bipartite graph	en_US
dc.subject	complete graph	en_US
dc.title	The linear 3-arboricity of Kn,n and Kn	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/j.disc.2007.07.067	en_US
dc.identifier.journal	DISCRETE MATHEMATICS	en_US
dc.citation.volume	308	en_US
dc.citation.issue	17	en_US
dc.citation.spage	3816	en_US
dc.citation.epage	3823	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000257303500007	-
dc.citation.woscount	3	-
Appears in Collections:	Articles

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.