Cyclically decomposing the complete graph into cycles
| dc.citation.epage | 273 | en_US |
| dc.citation.issue | 1-3 | en_US |
| dc.citation.spage | 267 | en_US |
| dc.citation.volume | 282 | en_US |
| dc.citation.woscount | 18 | |
| dc.contributor.author | Fu, HL | en_US |
| dc.contributor.author | Wu, SL | en_US |
| dc.contributor.department | 應用數學系 | zh_TW |
| dc.contributor.department | Department of Applied Mathematics | en_US |
| dc.date.accessioned | 2014-12-08T15:39:11Z | |
| dc.date.available | 2014-12-08T15:39:11Z | |
| dc.date.issued | 2004-05-06 | en_US |
| dc.description.abstract | Let m(1), m(2),..., m(k) be positive integers not less than 3 and let n = Sigma(i=1)(k) m(i). Then, it is proved that the complete graph of order 2n + 1 can be cyclically decomposed into k(2n + 1) cycles such that, for each i = 1, 2,...,k, the cycle of length mi occurs exactly 2n + 1 times. (C) 2003 Elsevier B.V. All rights reserved. | en_US |
| dc.identifier.doi | 10.1016/j.disc.2003.12.009 | en_US |
| dc.identifier.issn | 0012-365X | en_US |
| dc.identifier.journal | DISCRETE MATHEMATICS | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1016/j.disc.2003.12.009 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/26784 | |
| dc.identifier.wosnumber | WOS:000221634100029 | |
| dc.language.iso | en_US | en_US |
| dc.subject | complete graph | en_US |
| dc.subject | cycle system | en_US |
| dc.subject | skolem sequence | en_US |
| dc.subject | hooked skolem sequence | en_US |
| dc.subject | near skolem sequence | en_US |
| dc.title | Cyclically decomposing the complete graph into cycles | en_US |
| dc.type | Article | en_US |