Cycle decompositions of complete multigraphs

Autor: Daniel Horsley, Darryn Bryant, Benjamin R. Smith, Barbara Maenhaut
Rok vydání: 2010
Předmět:
Zdroj: Journal of Combinatorial Designs. 19:42-69
ISSN: 1063-8539
DOI: 10.1002/jcd.20263
Popis: In this paper we establish necessary and sufficient conditions for decomposing the complete multigraph lambda K(n) into cycles of length lambda, and the lambda-fold complete symmetric digraph lambda K(n)*, into directed cycles of length lambda. As a corollary to these results we obtain necessary and sufficient conditions for decomposing lambda K(n), (respectively, lambda K(n)*) into cycles (respectively, directed cycles) of prime length. (C) 2009 Wiley Periodicals, Inc. J Combin Designs 18: 85-93, 2010
Databáze: OpenAIRE