Packing balanced complete multipartite graphs with hexagons

Full metadata record

DC Field	Value	Language
dc.contributor.author	Fu, HL	en_US
dc.contributor.author	Huang, MH	en_US
dc.date.accessioned	2014-12-08T15:39:25Z	-
dc.date.available	2014-12-08T15:39:25Z	-
dc.date.issued	2004-04-01	en_US
dc.identifier.issn	0381-7032	en_US
dc.identifier.uri	http://hdl.handle.net/11536/26916	-
dc.description.abstract	In this paper, we completely solve the problem of finding a maximum packing of any balanced complete multipartite graph K-m(n) with edge-disjoint 6-cycles, and minimum leaves are explicitly given. Subsequently, we also find a minimum covering of K-m(n).	en_US
dc.language.iso	en_US	en_US
dc.title	Packing balanced complete multipartite graphs with hexagons	en_US
dc.type	Article	en_US
dc.identifier.journal	ARS COMBINATORIA	en_US
dc.citation.volume	71	en_US
dc.citation.issue		en_US
dc.citation.spage	49	en_US
dc.citation.epage	64	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000220545400003	-
dc.citation.woscount	2	-
Appears in Collections:	Articles