(m,n)-cycle systems

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Bryant, DE	en_US
dc.contributor.author	Khodkar, A	en_US
dc.contributor.author	Fu, HL	en_US
dc.date.accessioned	2014-12-08T15:47:26Z	-
dc.date.available	2014-12-08T15:47:26Z	-
dc.date.issued	1998-11-01	en_US
dc.identifier.issn	0378-3758	en_US
dc.identifier.uri	http://hdl.handle.net/11536/31795	-
dc.description.abstract	We describe a method which, in certain circumstances, may be used to prove that the well-known necessary conditions for partitioning the edge set of the complete graph on an odd number of vertices (or the complete graph on an even number of vertices with a 1-factor removed) into cycles of lengths m(1),m(2),...,m(t) are sufficient in the case {m(1), m(2), ..., m(t)}=2. The method is used to settle the case where the cycle lengths are 4 and 5. (C) 1998 Elsevier Science B.V. All rights reserved.	en_US
dc.language.iso	en_US	en_US
dc.title	(m,n)-cycle systems	en_US
dc.type	Article	en_US
dc.identifier.journal	JOURNAL OF STATISTICAL PLANNING AND INFERENCE	en_US
dc.citation.volume	74	en_US
dc.citation.issue	2	en_US
dc.citation.spage	365	en_US
dc.citation.epage	370	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
顯示於類別：	期刊論文

文件中的檔案：

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