On minimum sets of 1-factors covering a complete multipartite graph

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Cariolaro, David	en_US
dc.contributor.author	Fu, Hung-Lin	en_US
dc.date.accessioned	2014-12-08T15:11:19Z	-
dc.date.available	2014-12-08T15:11:19Z	-
dc.date.issued	2008-07-01	en_US
dc.identifier.issn	0364-9024	en_US
dc.identifier.uri	http://dx.doi.org/10.1002/jgt.20303	en_US
dc.identifier.uri	http://hdl.handle.net/11536/8681	-
dc.description.abstract	We determine necessary and sufficient conditions for a complete multipartite graph to admit a set of 1-factors whose union is the whole graph and, when these conditions are satisfied, we determine the minimum size of such a set. (c) 2008 Wiley Periodicals, hic.	en_US
dc.language.iso	en_US	en_US
dc.subject	1-factor	en_US
dc.subject	1-factor cover	en_US
dc.subject	excessive factorization	en_US
dc.subject	excessive index	en_US
dc.subject	complete multipartite graph	en_US
dc.title	On minimum sets of 1-factors covering a complete multipartite graph	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1002/jgt.20303	en_US
dc.identifier.journal	JOURNAL OF GRAPH THEORY	en_US
dc.citation.volume	58	en_US
dc.citation.issue	3	en_US
dc.citation.spage	239	en_US
dc.citation.epage	250	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000256629000004	-
dc.citation.woscount	6	-
顯示於類別：	期刊論文

文件中的檔案：

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