Uniformly Resolvable Cycle Decompositions with Four Different Factors


Odabasi U. , ÖZKAN S.

GRAPHS AND COMBINATORICS, vol.33, no.6, pp.1591-1606, 2017 (Journal Indexed in SCI) identifier identifier

  • Publication Type: Article / Article
  • Volume: 33 Issue: 6
  • Publication Date: 2017
  • Doi Number: 10.1007/s00373-017-1856-6
  • Title of Journal : GRAPHS AND COMBINATORICS
  • Page Numbers: pp.1591-1606

Abstract

In this paper, we consider uniformly resolvable decompositions of complete graph K-v( or K-v minus a 1-factor I for even v) into cycles. We will focus on the existence of factorizations of K-v or K-v - I containing up to four non-isomorphic factors. We obtain all possible solutions for uniform factors involving 4, m, 2m and 4m-cycles with a few possible exceptions when m is odd.