Uniformly Resolvable Cycle Decompositions with Four Different Factors

Odabasi U., ÖZKAN S.

GRAPHS AND COMBINATORICS, cilt.33, sa.6, ss.1591-1606, 2017 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 33 Sayı: 6
  • Basım Tarihi: 2017
  • Doi Numarası: 10.1007/s00373-017-1856-6
  • Dergi Adı: GRAPHS AND COMBINATORICS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.1591-1606
  • İstanbul Üniversitesi Adresli: Evet

Özet

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.