| 22769 |
Creator |
80b473f9888b354bf7fee26ec7cc369f |
| 22769 |
Creator |
c63396a7fbb007ccb76080db8037c860 |
| 22769 |
Creator |
ext-b164cb606a2519a76dfcfd300b8fa902 |
| 22769 |
Date |
2005 |
| 22769 |
Is Part Of |
repository |
| 22769 |
Is Part Of |
p08353026 |
| 22769 |
abstract |
An $m$-cycle system of order $v$, denoted by $m$CS($v$), is a decomposition of the
complete graph $K_v$ into $m$-cycles. We discuss two types of large sets of $m$CS($v$)
and construct examples of both types for $(m,v)=(4,9)$ and one type for $(m,v)=(6,9)$.
These are the first large sets of cycle systems constructed with $m>3$, apart from
the Hamiltonian cycle decompositions given by Bryant in 1998. |
| 22769 |
authorList |
authors |
| 22769 |
status |
peerReviewed |
| 22769 |
volume |
53, |
| 22769 |
type |
AcademicArticle |
| 22769 |
type |
Article |
| 22769 |
label |
Bryant, D. E.; Grannell, Mike and Griggs, Terry (2005). Large sets of cycle
systems on nine points. Journal of Combinatorial Mathematics and Combinatorial Computing,
53, pp. 95–102. |
| 22769 |
label |
Bryant, D. E.; Grannell, Mike and Griggs, Terry (2005). Large sets of cycle systems
on nine points. Journal of Combinatorial Mathematics and Combinatorial Computing,
53, pp. 95–102. |
| 22769 |
Title |
Large sets of cycle systems on nine points |
| 22769 |
in dataset |
oro |