Packing lambda-fold complete multipartite graphs with 4-cycles

完整後設資料紀錄

DC 欄位	值	語言
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:19:04Z	-
dc.date.available	2014-12-08T15:19:04Z	-
dc.date.issued	2005-06-01	en_US
dc.identifier.issn	0911-0119	en_US
dc.identifier.uri	http://dx.doi.org/10.1007/s00373-004-0601-0	en_US
dc.identifier.uri	http://hdl.handle.net/11536/13685	-
dc.description.abstract	A maximum packing of any lambda-fold complete multipartite graph (where there are lambda edges between any two vertices in different parts) with edge-disjoint 4- cycles is obtained and the size of each minimum leave is given. Moreover, when lambda =2, maximum 4-cycle packings are found for all possible leaves.	en_US
dc.language.iso	en_US	en_US
dc.title	Packing lambda-fold complete multipartite graphs with 4-cycles	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1007/s00373-004-0601-0	en_US
dc.identifier.journal	GRAPHS AND COMBINATORICS	en_US
dc.citation.volume	21	en_US
dc.citation.issue	2	en_US
dc.citation.spage	169	en_US
dc.citation.epage	185	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000229641500003	-
dc.citation.woscount	6	-
顯示於類別：	期刊論文

文件中的檔案：

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。