2 papers
math.CO2025
Redicoloring some classes of circulant tournaments
Narda Cordero-Michel, Mika Olsen
Given a digraph with no loops, the \textit{dicoloring graph} of , denoted by , is the graph whose vertices are the acyclic -colorings of and two col…
math.CO2025
Acyclic and complete coloring of digraphs with the minimum and maximum possible numbers of colors
Mika Olsen, Christian Rubio-Montiel, Alejandra Silva Ramirez
The dichromatic and diachromatic numbers of a digraph are the minimum and maximum numbers of colors, respectively, in acyclic and complete colorings of the digraph. In this paper,…