A procedure to obtain symmetric cycles of any odd length using directed Haj\'os constructions

TL;DR

This paper presents a method to construct symmetric cycles of any odd length using directed Hajós operations, generalizing previous work on specific cycle lengths and analyzing the method's computational complexity.

Contribution

The paper introduces a general procedure to generate any odd symmetric cycle from cycles of length 3 using directed Hajós constructions, extending prior specific cases.

Findings

Successfully constructs symmetric cycles of any odd length.

Provides analysis of the computational complexity of the procedure.

Generalizes previous methods for specific cycle lengths.

Abstract

The dichromatic number of a digraph $D$ is the minimum number of colors of a vertex coloring of $D$ such that $D$ has no monochromatic cycles. The Haj\'os join were recently extended to digraphs (using the dichromatic number) by J. Bang-Jensen et. al. and Haj\'os (directed) operations is a tool to obtain r-(di)chromatic (di)graphs. J. Bang-Jensen et. al. posed in 2020 the problem of how to obtain the symmetric cycle of length 5 from symmetric cycles of length 3. We recently solved this problem by applying a genetic algorithm. In this article, a procedure is presented to construct any odd symmetric cycle by applying directed Haj\'os operations to symmetric cycles of length 3, thus, generalizing the known construction of the symmetric cycle of length 5. In addition, this procedure is analyzed to determine its computational complexity.