Packing lambda-fold complete multipartite graphs with 4-cycles

標題:	Packing lambda-fold complete multipartite graphs with 4-cycles
作者:	Billington, EJ Fu, HL Rodger, CA 應用數學系 Department of Applied Mathematics
公開日期:	1-六月-2005
摘要:	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.
URI:	http://dx.doi.org/10.1007/s00373-004-0601-0 http://hdl.handle.net/11536/13685
ISSN:	0911-0119
DOI:	10.1007/s00373-004-0601-0
期刊:	GRAPHS AND COMBINATORICS
Volume:	21
Issue:	2
起始頁:	169
結束頁:	185
顯示於類別：	期刊論文

文件中的檔案：

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