Packing the Cartesian product of two complete graphs with hexagons

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Fu, HL	en_US
dc.contributor.author	Huang, MH	en_US
dc.date.accessioned	2014-12-08T15:19:16Z	-
dc.date.available	2014-12-08T15:19:16Z	-
dc.date.issued	2005-05-01	en_US
dc.identifier.issn	0315-3681	en_US
dc.identifier.uri	http://hdl.handle.net/11536/13783	-
dc.description.abstract	In this paper, we completely solve the problem of finding a maximum packing of K-m x K-n the cartesian product of two complete graphs with edge-disjoint 6-cycles, and minimum leaves are explicitly given. Subsequently, we also find a minimum covering of K-m x K-n.	en_US
dc.language.iso	en_US	en_US
dc.title	Packing the Cartesian product of two complete graphs with hexagons	en_US
dc.type	Article	en_US
dc.identifier.journal	UTILITAS MATHEMATICA	en_US
dc.citation.volume	67	en_US
dc.citation.issue		en_US
dc.citation.spage	129	en_US
dc.citation.epage	140	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000229264900011	-
dc.citation.woscount	0	-
顯示於類別：	期刊論文