THE DIRECTED UNIFORM HAMILTON-WATERLOO PROBLEM INVOLVING EVEN CYCLE SIZES

YETGİN F., ODABAŞI U., ÖZKAN S.

DISCUSSIONES MATHEMATICAE GRAPH THEORY, cilt.45, ss.615-636, 2025 (SCI-Expanded, Scopus) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 45
  • Basım Tarihi: 2025
  • Doi Numarası: 10.7151/dmgt.2549
  • Dergi Adı: DISCUSSIONES MATHEMATICAE GRAPH THEORY
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, Central & Eastern European Academic Source (CEEAS), MathSciNet, zbMATH, Directory of Open Access Journals
  • Sayfa Sayıları: ss.615-636
  • İstanbul Üniversitesi-Cerrahpaşa Adresli: Evet

Özet

In this paper, factorizations of the complete symmetric digraph K v & lowast; into uniform factors consisting of directed even cycle factors are studied as a generalization of the undirected Hamilton -Waterloo Problem. It is shown, with a few possible exceptions, that K v & lowast; can be factorized into two nonisomorphic factors, where these factors are uniform factors of K v & lowast; involving K 2 & lowast; or directed m -cycles, and directed m -cycles or 2m m -cycles for even m .