Excessive near 1-factorizations

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Cariolaro, David	en_US
dc.contributor.author	Fu, Hung-Lin	en_US
dc.date.accessioned	2014-12-08T15:09:06Z	-
dc.date.available	2014-12-08T15:09:06Z	-
dc.date.issued	2009-07-28	en_US
dc.identifier.issn	0012-365X	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/j.disc.2008.05.035	en_US
dc.identifier.uri	http://hdl.handle.net/11536/6936	-
dc.description.abstract	We begin the study of sets of near 1-factors of graphs G of odd order whose union contains all the edges of G and determine, for a few classes of graphs, the mini mum number of near 1-factors in such sets. (C) 2008 Elsevier B.V. All rights reserved.	en_US
dc.language.iso	en_US	en_US
dc.subject	Near 1-factor	en_US
dc.subject	Near 1-factorization	en_US
dc.subject	Excessive near 1-factorization	en_US
dc.subject	Excessive index	en_US
dc.title	Excessive near 1-factorizations	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/j.disc.2008.05.035	en_US
dc.identifier.journal	DISCRETE MATHEMATICS	en_US
dc.citation.volume	309	en_US
dc.citation.issue	14	en_US
dc.citation.spage	4690	en_US
dc.citation.epage	4696	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000267632300004	-
dc.citation.woscount	3	-
顯示於類別：	期刊論文

文件中的檔案：

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