Multicolored parallelisms of isomorphic spanning trees

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Akbari, S.	en_US
dc.contributor.author	Alipour, A.	en_US
dc.contributor.author	Fu, H. L.	en_US
dc.contributor.author	Lo, Y. H.	en_US
dc.date.accessioned	2014-12-08T15:17:51Z	-
dc.date.available	2014-12-08T15:17:51Z	-
dc.date.issued	2006	en_US
dc.identifier.issn	0895-4801	en_US
dc.identifier.uri	http://hdl.handle.net/11536/12935	-
dc.identifier.uri	http://dx.doi.org/10.1137/S0895480104446015	en_US
dc.description.abstract	A subgraph in an edge-colored graph is multicolored if all its edges receive distinct colors. In this paper, we prove that a complete graph on 2m (m not equal 2) vertices K-2m can be properly edge-colored with 2m - 1 colors in such a way that the edges of K-2m can be partitioned into m multicolored isomorphic spanning trees.	en_US
dc.language.iso	en_US	en_US
dc.subject	complete graph	en_US
dc.subject	multicolored tree	en_US
dc.subject	parallelism	en_US
dc.title	Multicolored parallelisms of isomorphic spanning trees	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1137/S0895480104446015	en_US
dc.identifier.journal	SIAM JOURNAL ON DISCRETE MATHEMATICS	en_US
dc.citation.volume	20	en_US
dc.citation.issue	3	en_US
dc.citation.spage	564	en_US
dc.citation.epage	567	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000242572400002	-
dc.citation.woscount	1	-
顯示於類別：	期刊論文

文件中的檔案：

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