Packing complete multipartite graphs with 4-cycles

Full metadata record

DC Field	Value	Language
dc.contributor.author	Billington, EJ	en_US
dc.contributor.author	Fu, HL	en_US
dc.contributor.author	Rodger, CA	en_US
dc.date.accessioned	2014-12-08T15:44:25Z	-
dc.date.available	2014-12-08T15:44:25Z	-
dc.date.issued	2001	en_US
dc.identifier.issn	1063-8539	en_US
dc.identifier.uri	http://hdl.handle.net/11536/30000	-
dc.description.abstract	In this paper we completely solve the problem of finding a maximum packing of any complete multipartite graph with edge-disjoint 4-cycles, and the minimum leaves are explicitly given. (C) 2001 John Wiley & Sons, Inc.	en_US
dc.language.iso	en_US	en_US
dc.subject	cycle packing	en_US
dc.subject	multipartite	en_US
dc.subject	4-cycles	en_US
dc.title	Packing complete multipartite graphs with 4-cycles	en_US
dc.type	Article	en_US
dc.identifier.journal	JOURNAL OF COMBINATORIAL DESIGNS	en_US
dc.citation.volume	9	en_US
dc.citation.issue	2	en_US
dc.citation.spage	107	en_US
dc.citation.epage	127	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000167263300003	-
dc.citation.woscount	11	-
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.