Premium
Cycle decompositions III: Complete graphs and fixed length cycles
Author(s) -
Šajna Mateja
Publication year - 2001
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.1027
Subject(s) - mathematics , combinatorics , graph , order (exchange) , decomposition , discrete mathematics , ecology , finance , economics , biology
We show that the necessary conditions for the decomposition of the complete graph of odd order into cycles of a fixed even length and for the decomposition of the complete graph of even order minus a 1‐factor into cycles of a fixed odd length are also sufficient. © 2002 John Wiley & Sons, Inc. J Combin Designs 10: 27–78, 2002