加载中…
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 .

生成讲解博客的中文版本

生成AI智能校验的中文版本