On the directed Hamilton-Waterloo problem with two cycle sizes

MaRDI QIDQ6982972zbMATH OpenFDO

Authors Fatih Yetgin, Uğur Odabaşı, Sibel Özkan

Publication date 15 May 2025

Published in Contributions to Discrete Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NoDerivs 4.0 International

Full work available at URL https://cdm.ucalgary.ca/article/view/75051

zbMATH Keywords

complete symmetric digraphcycle factorizationsdirected factorizationsdirected Hamilton-Waterloo problem

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• scientific article; zbMATH DE number 5917757 (Why is no real title available?)
• scientific article; zbMATH DE number 3922695 (Why is no real title available?)
• scientific article; zbMATH DE number 1550912 (Why is no real title available?)
• scientific article; zbMATH DE number 3349817 (Why is no real title available?)
• Completing the solution of the directed Oberwolfach problem with cycles of equal length
• Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
• Merging combinatorial design and optimization: the Oberwolfach problem
• Octahedral, dicyclic and special linear solutions of some Hamilton-Waterloo problems
• On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem
• On the Hamilton-Waterloo problem
• On the Hamilton-Waterloo problem for bipartite 2-factors
• On the Hamilton-Waterloo problem with odd cycle lengths
• On the Hamilton-Waterloo problem with odd orders
• On the directed Oberwolfach Problem with equal cycle lengths: the odd case
• On the directed Oberwolfach problem with equal cycle lengths
• Resolvable Mendelsohn designs with block size 4
• Resolvable decomposition of K^*_n
• Resolvable perfect Mendelsohn designs with block size five
• Some observations on the oberwolfach problem
• The Hamilton-Waterloo problem for cycle sizes 3 and 4
• The Hamilton-Waterloo problem with 4-cycles and a single factor of \(n\)-cycles
• The Hamilton-Waterloo problem with \(C_4\) and \(C_m\) factors
• The Oberwolfach problem and factors of uniform odd length cycles
• The equipartite Oberwolfach problem with uniform tables
• The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
• Two-factorisations of complete graphs of orders fifteen and seventeen

Cited in

(1)

• The directed uniform Hamilton-Waterloo problem involving even cycle sizes

This page was built for publication: On the directed Hamilton-Waterloo problem with two cycle sizes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982972)