FACTORIZATIONS OF COMPLETE GRAPHS INTO CYCLES AND 1-FACTORS

Odabasi U.

CONTRIBUTIONS TO DISCRETE MATHEMATICS, vol.15, no.1, pp.80-89, 2020 (SCI-Expanded, Scopus) identifier identifier

  • Publication Type: Article / Article
  • Volume: 15 Issue: 1
  • Publication Date: 2020
  • Journal Name: CONTRIBUTIONS TO DISCRETE MATHEMATICS
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus, zbMATH
  • Page Numbers: pp.80-89
  • Keywords: Resolvable graph decompositions, Factorizations, 2-factors, 1-factors, HAMILTON-WATERLOO PROBLEM, OBERWOLFACH PROBLEM, DECOMPOSITION
  • Istanbul University-Cerrahpasa Affiliated: Yes

Abstract

In this paper, we consider factorizations of complete graph K-v into cycles and 1-factors. We will focus on the existence of factorizations of K-v containing two nonisomorphic factors. We obtain all possible solutions for uniform factors involving m-cycles and 1-factors with a few possible exceptions when m is odd.