DECOMPOSING THE COMPLETE GRAPH INTO HAMILTONIAN PATHS (CYCLES) AND 3-STARS

dc.citation.epage	839	en_US
dc.citation.issue	3	en_US
dc.citation.spage	823	en_US
dc.citation.volume	40	en_US
dc.citation.woscount	0	en_US
dc.contributor.author	Lee, Hung-Chih	en_US
dc.contributor.author	Chen, Zhen-Chun	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.date.accessioned	2020-10-05T01:59:39Z
dc.date.available	2020-10-05T01:59:39Z
dc.date.issued	2020-01-01	en_US
dc.description.abstract	Let H be a graph. A decomposition of H is a set of edge-disjoint sub-graphs of H whose union is H. A Hamiltonian path (respectively, cycle) of H is a path (respectively, cycle) that contains every vertex of H exactly once. A k-star, denoted by S-k, is a star with k edges. In this paper, we give necessary and sufficient conditions for decomposing the complete graph into alpha copies of Hamiltonian path (cycle) and beta copies of S-3.	en_US
dc.identifier.doi	10.7151/dmgt.2153	en_US
dc.identifier.issn	1234-3099	en_US
dc.identifier.journal	DISCUSSIONES MATHEMATICAE GRAPH THEORY	en_US
dc.identifier.uri	http://dx.doi.org/10.7151/dmgt.2153	en_US
dc.identifier.uri	https://ir.lib.nycu.edu.tw/handle/11536/154808
dc.identifier.wosnumber	WOS:000544676900009	en_US
dc.language.iso	en_US	en_US
dc.subject	decomposition	en_US
dc.subject	complete graph	en_US
dc.subject	Hamiltonian path	en_US
dc.subject	Hamiltonian cycle	en_US
dc.subject	star	en_US
dc.title	DECOMPOSING THE COMPLETE GRAPH INTO HAMILTONIAN PATHS (CYCLES) AND 3-STARS	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1