On the Directed Hamilton-Waterloo Problem with Two Cycle Sizes

MaRDI QIDQ6412321zbMATH OpenFDO

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

Publication date 29 September 2022

Mathematics Subject Classification ID

Graph designs and isomorphic decomposition (05C51) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: The Directed Hamilton-Waterloo Problem asks for a directed $2$-factorization of the complete symmetric digraph $K_v^{\ast }$ where there are two non-isomorphic $2$-factors. In the uniform version of the problem, factors consist of either directed $m$-cycles or $n$-cycles. In this paper, necessary conditions for a solution of this problem are given, and the problem is solved for the factors with $$,$$.

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 Q6412321)