| dc.contributor.author | Smith, Benjamin R. | |
| dc.contributor.author | Cavenagh, Nicholas J. | |
| dc.date.accessioned | 2011-11-17T22:29:32Z | |
| dc.date.available | 2011-11-17T22:29:32Z | |
| dc.date.issued | 2010 | |
| dc.identifier.citation | Smith, B.R. & Cavenagh, N.J. (2010). Decomposing complete equipartite graphs into short even cycles. Journal of Combinatorial Designs, 19(2), 131-143. | en_NZ |
| dc.identifier.uri | https://hdl.handle.net/10289/5900 | |
| dc.description.abstract | In this article we find necessary and sufficient conditions to decompose a complete equipartite graph into cycles of uniform length, in the case that the length is both even and short relative to the number of parts. | en_NZ |
| dc.language.iso | en | |
| dc.publisher | Wiley | en_NZ |
| dc.relation.uri | http://onlinelibrary.wiley.com/doi/10.1002/jcd.20265/abstract | en_NZ |
| dc.subject | graph decomposition | en_NZ |
| dc.subject | cycle | en_NZ |
| dc.subject | complete equipartite graph | en_NZ |
| dc.title | Decomposing complete equipartite graphs into short even cycles | en_NZ |
| dc.type | Journal Article | en_NZ |
| dc.identifier.doi | 10.1002/jcd.20265 | en_NZ |
| dc.relation.isPartOf | The Electronic Journal of Combinatorics | en_NZ |
| pubs.begin-page | 1 | en_NZ |
| pubs.elements-id | 35445 | |
| pubs.end-page | 21 | en_NZ |
| pubs.issue | 1 | en_NZ |
| pubs.volume | 17 | en_NZ |
| uow.identifier.article-no | 1 | en_NZ |
