Some Results on 4-cycle Packings

dc.citation.epage	23	en_US
dc.citation.issue		en_US
dc.citation.spage	15	en_US
dc.citation.volume	93	en_US
dc.citation.woscount	0
dc.contributor.author	Fu, Hung-Lin	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.date.accessioned	2014-12-08T15:08:38Z
dc.date.available	2014-12-08T15:08:38Z
dc.date.issued	2009-10-01	en_US
dc.description.abstract	A packing of a graph G is a set of edge-disjoint 4-cycles in G and a maximum packing of G with 4-cycles is a packing which contains the largest number of 4-cycles among all packings of G. In this paper, we obtain the maximum packing of certain graphs such as K(2m+1) - H where H is a 2-regular subgraph, K(2m) - F where F is a spanning odd forest of K(2m) and 2K(2m) - L where L is a 2-regular subgraph of 2K(2m).	en_US
dc.identifier.issn	0381-7032	en_US
dc.identifier.journal	ARS COMBINATORIA	en_US
dc.identifier.uri	https://ir.lib.nycu.edu.tw/handle/11536/6629
dc.identifier.wosnumber	WOS:000271166200002
dc.language.iso	en_US	en_US
dc.title	Some Results on 4-cycle Packings	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1