|Google Scholar:||Look up in Google Scholar|
An -cycle system of order , denoted by CS(), is a decomposition of the complete graph into -cycles. We discuss two types of large sets of CS() and construct examples of both types for and one type for . These are the first large sets of cycle systems constructed with , apart from the Hamiltonian cycle decompositions given by Bryant in 1998.
|Item Type:||Journal Article|
|Academic Unit/Department:||Mathematics, Computing and Technology > Mathematics and Statistics|
|Depositing User:||Mike Grannell|
|Date Deposited:||18 Aug 2010 13:02|
|Last Modified:||02 Dec 2010 21:02|
|Share this page:|