We prove that there exists a cyclic Hamiltonian k-cycle system of the complete graph if and only if k is odd but $k \neq 15$ and $p^\alpha$ with p prime and $\alpha>1$. As a consequence we have the existence of a cyclic k-cycle system of the complete graph on km vertices for any pair (k,m) of odd integers with k as above but $(k,m) \neq (3,3)$.
Cyclic Hamiltonian cycle systems of the complete graph
BURATTI, Marco;
2004
Abstract
We prove that there exists a cyclic Hamiltonian k-cycle system of the complete graph if and only if k is odd but $k \neq 15$ and $p^\alpha$ with p prime and $\alpha>1$. As a consequence we have the existence of a cyclic k-cycle system of the complete graph on km vertices for any pair (k,m) of odd integers with k as above but $(k,m) \neq (3,3)$.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
