The Directed Uniform Hamilton-Waterloo Problem Involving Even Cycle Sizes
Combinatorics
2023-06-22 v1
Abstract
In this paper, factorizations of the complete symmetric digraph 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 can be factorized into two nonisomorphic factors, where these factors are uniform factors of involving or directed -cycles, and directed -cycles or -cycles for even .
Cite
@article{arxiv.2306.12209,
title = {The Directed Uniform Hamilton-Waterloo Problem Involving Even Cycle Sizes},
author = {Fatih Yetgin and Uğur Odabaşı and Sibel Özkan},
journal= {arXiv preprint arXiv:2306.12209},
year = {2023}
}