Cyclically decomposing the complete graph into cycles
Authors:
- Hung-Lin FuHFHung-Lin Fu
- 6 May 2004
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 282 (1-3) , 267-273
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Existence of cyclic k-cycle systems of the complete graphDiscrete Mathematics, 2003
- Cycle decompositions III: Complete graphs and fixed length cyclesJournal of Combinatorial Designs, 2001
- Cycle Decompositions of K and K−IJournal of Combinatorial Theory, Series B, 2001
- The existence of near-Skolem and hooked near-Skolem sequencesDiscrete Mathematics, 1994
- Research problemsDiscrete Mathematics, 1981
- Verification of a Conjecture of Th. Skolem.MATHEMATICA SCANDINAVICA, 1961
- On certain distributions of integers in pairs with given differencesMATHEMATICA SCANDINAVICA, 1957