Ascending subgraph decompositions of regular graphs

Full metadata record

DC Field	Value	Language
dc.contributor.author	Fu, HL	en_US
dc.contributor.author	Hu, WH	en_US
dc.date.accessioned	2014-12-08T15:42:18Z	-
dc.date.available	2014-12-08T15:42:18Z	-
dc.date.issued	2002-06-06	en_US
dc.identifier.issn	0012-365X	en_US
dc.identifier.uri	http://hdl.handle.net/11536/28725	-
dc.description.abstract	We prove that every regular graph with ((n+1)(2)) + t edges, 0 less than or equal to t < n + 1, can be decomposed into n subgraphs G(1),G(2),...,G(n) such that E(G(i)) = i and G(i) less than or equal to G(i+1) for i = 1,2,...,n - 1 and E(G(n)) = n + t. (C) 2002 Elsevier Science B.V. All rights reserved.	en_US
dc.language.iso	en_US	en_US
dc.subject	ascending subgraph decomposition	en_US
dc.subject	regular graph	en_US
dc.title	Ascending subgraph decompositions of regular graphs	en_US
dc.type	Article	en_US
dc.identifier.journal	DISCRETE MATHEMATICS	en_US
dc.citation.volume	253	en_US
dc.citation.issue	1-3	en_US
dc.citation.spage	11	en_US
dc.citation.epage	18	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000176323900003	-
dc.citation.woscount	2	-
Appears in Collections:	Articles

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.