Dicoloring Graphs: Theory & Reconfiguration

• Dicoloring graphs are reconfiguration graphs whose vertices represent acyclic k-colorings of a digraph and edges connect colorings that differ at exactly one vertex.
• They extend classical graph coloring by permitting same-colored adjacent vertices as long as no directed cycle forms, capturing the directed analogue of chromatic concepts.
• Recent advances use dense decompositions and probabilistic methods to prove large-degree (Δ–1) dicoloring theorems and analyze connectivity in reconfiguration spaces.

Searching arXiv for foundational and papers on dicoloring, dichromatic number, and dicoloring graphs. A dicoloring graph is the reconfiguration graph associated with acyclic colorings of a digraph. For a digraph $D$ and an integer $k\ge \vec{\chi}(D)$, its $k$-dicoloring graph $\mathcal{D}_k(D)$ has as vertices the acyclic $k$-colorings of $D$, and two colorings are adjacent when they differ on exactly one vertex (Cordero-Michel et al., 6 Oct 2025). The notion is inseparable from the underlying theory of dicoloring—also called dichromatic coloring—in which a color class is required to induce an acyclic subdigraph rather than an independent set (Harutyunyan et al., 14 Jul 2025). In that sense, dicoloring is the directed analogue of graph coloring, the dichromatic number $\vec{\chi}(D)$ is the minimum number of acyclic color classes, and the dicoloring graph encodes the geometry of the space of such colorings under one-vertex recoloring moves (Harutyunyan et al., 14 Jul 2025, Cordero-Michel et al., 6 Oct 2025).

1. Definitions and formal framework

A dicoloring of a digraph $D$ is a vertex-coloring

$\varphi:V(D)\to [k]$

such that each color class induces an acyclic subdigraph; equivalently, for every $i\in [k]$, the induced subdigraph $k\ge \vec{\chi}(D)$0 contains no directed cycle (Harutyunyan et al., 14 Jul 2025). The least such $k\ge \vec{\chi}(D)$1 is the dichromatic number

$k\ge \vec{\chi}(D)$2

which plays the role of the chromatic number in directed graph theory (Harutyunyan et al., 14 Jul 2025).

The reconfiguration object built from these colorings is the $k\ge \vec{\chi}(D)$3-dicoloring graph

$k\ge \vec{\chi}(D)$4

Its vertices are the acyclic $k\ge \vec{\chi}(D)$5-colorings of $k\ge \vec{\chi}(D)$6, and two such colorings are adjacent precisely when they differ on one vertex (Cordero-Michel et al., 6 Oct 2025). Standard reconfiguration terminology is used in this setting: $k\ge \vec{\chi}(D)$7 is $k\ge \vec{\chi}(D)$8-mixing when $k\ge \vec{\chi}(D)$9 is connected, and $k$0-freezable when $k$1 contains an isolated vertex (Cordero-Michel et al., 6 Oct 2025).

This framework differs fundamentally from ordinary graph coloring. In an undirected proper coloring, same-colored adjacent vertices are forbidden. In a dicoloring, same-colored adjacency is permitted unless it participates in a monochromatic directed cycle. Thus the obstruction is global and cyclic rather than purely local. A complete symmetric digraph, in which every pair of vertices forms a digon, behaves like a clique because any same-colored pair would already create a monochromatic directed cycle of length $k$2 (Higgins, 2024).

A useful symmetrization principle links directed and undirected coloring. If $k$3 is an undirected graph and $k$4 is obtained by replacing each edge by a digon, then

$k$5

so ordinary graph coloring is recovered as a special case of dicoloring on symmetric digraphs (Harutyunyan et al., 14 Jul 2025).

2. Core parameters, obstructions, and the directed analogue of clique structure

The modern structural theory of dicoloring relies on directed analogues of classical graph parameters. In the large-degree theory of dicoloring, the principal clique-type parameter is the biclique number $k$6, where a biclique is an induced complete digraph $k$7 on $k$8 vertices (Harutyunyan et al., 14 Jul 2025). This replaces clique number in several directed Brooks- and Borodin–Kostochka-type statements.

Several degree parameters are used. For a vertex $k$9, $\mathcal{D}_k(D)$0 and $\mathcal{D}_k(D)$1 denote out-degree and in-degree. Global parameters include

$\mathcal{D}_k(D)$2

the geometric-mean degree parameter

$\mathcal{D}_k(D)$3

and

$\mathcal{D}_k(D)$4

(Harutyunyan et al., 14 Jul 2025). In descriptive results on Borel digraphs, the degree notion is often

$\mathcal{D}_k(D)$5

with boundedness assumed pointwise (Higgins, 2024).

A central discovery of recent structural work is that the naive directed analogue of a clique obstruction is incomplete. The digraph

$\mathcal{D}_k(D)$6

consisting of a directed triangle, a disjoint biclique of size $\mathcal{D}_k(D)$7, and all possible arcs in both directions between them, satisfies

$\mathcal{D}_k(D)$8

(Harutyunyan et al., 14 Jul 2025). This makes $\mathcal{D}_k(D)$9 an essentially directed obstruction with no undirected counterpart. It shows that one cannot hope for a general implication of the form “$k$0 implies $k$1” without excluding this configuration (Harutyunyan et al., 14 Jul 2025).

This obstruction is also conceptually important for dicoloring graphs. Frozen or poorly connected regions of $k$2 often arise from maximal or rigid acyclic color classes, and $k$3-type structures exhibit the broader phenomenon that directed cyclic interactions create rigidity absent from ordinary coloring.

3. Large-degree dicoloring theory

A major recent development is the extension of Borodin–Kostochka-type $k$4-colorability to digraphs. The conjectural directed form states that if

$k$5

then

$k$6

unless $k$7 contains either a biclique of size $k$8 or the exceptional configuration $k$9 (Harutyunyan et al., 14 Jul 2025). The same work formulates separate $D$0- and $D$1-versions and proves large-$D$2 results for both, thereby extending Reed’s large-degree theorem to directed settings (Harutyunyan et al., 14 Jul 2025).

The first theorem states that there exists $D$3 such that for every $D$4, if

$D$5

then

$D$6

unless $D$7 contains $D$8 (Harutyunyan et al., 14 Jul 2025). A parallel theorem is proved for $D$9, with an explicit reduction showing it holds for

$\vec{\chi}(D)$0

(Harutyunyan et al., 14 Jul 2025).

The same paper establishes a third independent large-degree direction using $\vec{\chi}(D)$1. For sufficiently large $\vec{\chi}(D)$2, every digraph $\vec{\chi}(D)$3 with

$\vec{\chi}(D)$4

contains a $\vec{\chi}(D)$5-obstruction of a specified bipartite form (Harutyunyan et al., 14 Jul 2025). Two corollaries follow. First, if

$\vec{\chi}(D)$6

equivalently $\vec{\chi}(D)$7, then

$\vec{\chi}(D)$8

for sufficiently large $\vec{\chi}(D)$9 (Harutyunyan et al., 14 Jul 2025). Second, if the underlying graph $D$0 satisfies $D$1, then again $D$2 (Harutyunyan et al., 14 Jul 2025).

These results place dicoloring theory in close formal analogy with high-degree graph coloring, but the analogy is not exact. The exceptional obstruction $D$3 is intrinsically directed, and its presence is precisely what prevents a direct transplantation of the undirected theory (Harutyunyan et al., 14 Jul 2025).

4. Proof methods and structural decomposition

The principal technical engine behind the large-$D$4 theorem is a dense decomposition lemma for digraphs, explicitly presented as a directed generalization of the Molloy–Reed dense decomposition for graphs (Harutyunyan et al., 14 Jul 2025). With $D$5, a vertex $D$6 is called $D$7-sparse if the digraph induced by its out-neighbourhood contains at most

$D$8

arcs; otherwise it is $D$9-dense (Harutyunyan et al., 14 Jul 2025).

For every $\varphi:V(D)\to [k]$0 and every $\varphi:V(D)\to [k]$1, every sufficiently large digraph with $\varphi:V(D)\to [k]$2 admits a partition

$\varphi:V(D)\to [k]$3

such that each $\varphi:V(D)\to [k]$4 has size close to $\varphi:V(D)\to [k]$5,

$\varphi:V(D)\to [k]$6

few arcs leave or enter $\varphi:V(D)\to [k]$7,

$\varphi:V(D)\to [k]$8

membership is characterized by having almost all out-neighbours inside $\varphi:V(D)\to [k]$9,

$i\in [k]$0

and every vertex of $i\in [k]$1 is $i\in [k]$2-sparse (Harutyunyan et al., 14 Jul 2025). The resulting parts behave as “dense modules” close to bicliques.

The coloring argument then combines probabilistic and structural components. Sparse vertices are handled by random coloring and deletion: every vertex is colored uniformly from $i\in [k]$3, then uncolored if it lies on a monochromatic directed cycle (Harutyunyan et al., 14 Jul 2025). Dense parts are treated by a detailed structural analysis of minimal counterexamples. This yields quasi-biclique structure, forbidden-configuration lemmas, and a “saviour” mechanism producing many disjoint local configurations that guarantee extendability after partial random coloring (Harutyunyan et al., 14 Jul 2025).

The probabilistic estimates use Talagrand concentration for repeated colors in sparse out-neighbourhoods and Azuma concentration for the number of good saviour-tuples, with bad-event bounds

$i\in [k]$4

for $i\in [k]$5 (Harutyunyan et al., 14 Jul 2025). Since dependencies are confined to distance-$i\in [k]$6 neighborhoods in the underlying graph, the Lovász Local Lemma yields an extendable partial $i\in [k]$7-dicoloring (Harutyunyan et al., 14 Jul 2025).

The $i\in [k]$8-theorem is proved by a different route because $i\in [k]$9 alone gives no control on in-degrees. There the proof proceeds by minimal counterexample analysis, auxiliary digraphs, and a discharging-style boundedness argument leading to explicit index-class estimates

$k\ge \vec{\chi}(D)$00

and hence

$k\ge \vec{\chi}(D)$01

contradicting $k\ge \vec{\chi}(D)$02 (Harutyunyan et al., 14 Jul 2025).

A plausible implication is that the modern theory of dicoloring is no longer primarily extremal in the elementary sense; it is increasingly organized around decomposition, concentration, and minimal-counterexample rigidity.

5. Reconfiguration: the dicoloring graph $k\ge \vec{\chi}(D)$03

The reconfiguration perspective studies not only the existence of acyclic colorings but also the connectivity and diameter of the space of such colorings. In this setting, the dicoloring graph $k\ge \vec{\chi}(D)$04 is the analogue of the undirected coloring graph $k\ge \vec{\chi}(D)$05 (Cordero-Michel et al., 6 Oct 2025).

A general theorem states that if a digraph $k\ge \vec{\chi}(D)$06 is uniquely $k\ge \vec{\chi}(D)$07-colorable, then $k\ge \vec{\chi}(D)$08 is $k\ge \vec{\chi}(D)$09-freezable and $k\ge \vec{\chi}(D)$10 consists of $k\ge \vec{\chi}(D)$11 isolated vertices (Cordero-Michel et al., 6 Oct 2025). This provides a standard mechanism for total reconfiguration failure. From previously known uniquely colorable tournaments, it follows that for each $k\ge \vec{\chi}(D)$12 there exists a tournament whose $k\ge \vec{\chi}(D)$13-dicoloring graph has $k\ge \vec{\chi}(D)$14 isolated vertices (Cordero-Michel et al., 6 Oct 2025).

There is, however, a universal high-color mixing bound depending on order rather than dichromatic number. Any digraph $k\ge \vec{\chi}(D)$15 of order $k\ge \vec{\chi}(D)$16 is $k\ge \vec{\chi}(D)$17-mixing for every $k\ge \vec{\chi}(D)$18, and $k\ge \vec{\chi}(D)$19 has diameter at most $k\ge \vec{\chi}(D)$20 (Cordero-Michel et al., 6 Oct 2025). This guarantees eventual connectivity once the number of colors is sufficiently large relative to the number of vertices.

By contrast, there is no function $k\ge \vec{\chi}(D)$21 depending only on the dichromatic number such that $k\ge \vec{\chi}(D)$22 is connected for all $k\ge \vec{\chi}(D)$23 and all $k\ge \vec{\chi}(D)$24 (Cordero-Michel et al., 6 Oct 2025). The paper establishing this gives a directed analogue of a theorem of Cereceda in undirected recoloring theory. Its significance is that $k\ge \vec{\chi}(D)$25 is too coarse to control reconfiguration geometry: two digraphs with the same dichromatic number may have radically different dicoloring graphs (Cordero-Michel et al., 6 Oct 2025).

This negative result corrects a common misconception. Existence theory for dicolorings often suggests that once $k\ge \vec{\chi}(D)$26 exceeds the dichromatic number by a bounded amount, the solution space should become connected. The reconfiguration results show that no such principle holds with $k\ge \vec{\chi}(D)$27 alone as the governing parameter (Cordero-Michel et al., 6 Oct 2025).

6. Circulant tournaments and explicit dicoloring graphs

The most detailed current calculations of dicoloring graphs concern circulant tournaments. Two families are central: the cyclic circulant tournament

$k\ge \vec{\chi}(D)$28

and the one-reversed-jump family

$k\ge \vec{\chi}(D)$29

(Cordero-Michel et al., 6 Oct 2025).

For the cyclic family, one has

$k\ge \vec{\chi}(D)$30

and every $k\ge \vec{\chi}(D)$31-coloring partitions the vertices into two cyclic intervals of the form

$k\ge \vec{\chi}(D)$32

for some $k\ge \vec{\chi}(D)$33 (Cordero-Michel et al., 6 Oct 2025). This interval structure yields an exact reconfiguration theorem: $k\ge \vec{\chi}(D)$34 (Cordero-Michel et al., 6 Oct 2025). For every $k\ge \vec{\chi}(D)$35, the same family is $k\ge \vec{\chi}(D)$36-mixing and the diameter satisfies

$k\ge \vec{\chi}(D)$37

(Cordero-Michel et al., 6 Oct 2025).

The family $k\ge \vec{\chi}(D)$38 is more rigid. A key local obstruction is the forbidden triangle

$k\ge \vec{\chi}(D)$39

which induces a maximal acyclic subtournament (Cordero-Michel et al., 6 Oct 2025). Acyclic subtournaments have size at most $k\ge \vec{\chi}(D)$40, and those of size $k\ge \vec{\chi}(D)$41 have an explicit arithmetic classification (Cordero-Michel et al., 6 Oct 2025). A major extension lemma shows that any color class that is not a forbidden triangle can be transformed into a canonical interval of length $k\ge \vec{\chi}(D)$42, which becomes the basis of most connectivity proofs (Cordero-Michel et al., 6 Oct 2025).

For $k\ge \vec{\chi}(D)$43, the $k\ge \vec{\chi}(D)$44-dicoloring graph is connected with

$k\ge \vec{\chi}(D)$45

(Cordero-Michel et al., 6 Oct 2025). For $k\ge \vec{\chi}(D)$46, $k\ge \vec{\chi}(D)$47, and

$k\ge \vec{\chi}(D)$48

one has connectivity and

$k\ge \vec{\chi}(D)$49

(Cordero-Michel et al., 6 Oct 2025).

The exceptional case is

$k\ge \vec{\chi}(D)$50

when $k\ge \vec{\chi}(D)$51. Then $k\ge \vec{\chi}(D)$52 is not connected; it contains

$k\ge \vec{\chi}(D)$53

isolated vertices arising from colorings whose classes are all forbidden triangles, together with one additional component whose diameter is at most

$k\ge \vec{\chi}(D)$54

(Cordero-Michel et al., 6 Oct 2025).

A distinguished special case is the Paley tournament

$k\ge \vec{\chi}(D)$55

For every $k\ge \vec{\chi}(D)$56,

$k\ge \vec{\chi}(D)$57

(Cordero-Michel et al., 6 Oct 2025). For $k\ge \vec{\chi}(D)$58, computational enumeration gives exact orders, sizes, and the same diameter $k\ge \vec{\chi}(D)$59; for example, when $k\ge \vec{\chi}(D)$60, $k\ge \vec{\chi}(D)$61 has order $k\ge \vec{\chi}(D)$62, size $k\ge \vec{\chi}(D)$63, and diameter $k\ge \vec{\chi}(D)$64 (Cordero-Michel et al., 6 Oct 2025).

7. Related directions: planar, measurable, and definable dicoloring

Dicoloring also appears in planar and descriptive settings, where the emphasis shifts from finite extremal structure to acyclic partitions and definability.

In planar digraph theory, a partition into two acyclic sets is exactly a $k\ge \vec{\chi}(D)$65-dicoloring. One recent line studies CAI-partitions, where the vertex set is partitioned into a connected acyclic subgraph and an independent set (Cambie et al., 2024). For Eulerian oriented planar triangulations with tripartition $k\ge \vec{\chi}(D)$66, if one of the induced bipartite graphs $k\ge \vec{\chi}(D)$67 has a CAI-partition, then the full digraph can be partitioned into two acyclic sets (Cambie et al., 2024). This yields a sufficient condition for $k\ge \vec{\chi}(D)$68-dicoloring but not a characterization: there exists an Eulerian oriented planar triangulation such that for every tripartition class $k\ge \vec{\chi}(D)$69, the graph $k\ge \vec{\chi}(D)$70 admits no CAI-partition (Cambie et al., 2024). The paper thus proves both positive subcubic results and a limitation theorem for this strategy (Cambie et al., 2024).

In descriptive set theory, the measurable analogue of Brooks’s theorem has been established for directed graphs. If $k\ge \vec{\chi}(D)$71 is a Borel digraph on a standard Borel space, $k\ge \vec{\chi}(D)$72 for all $k\ge \vec{\chi}(D)$73, and $k\ge \vec{\chi}(D)$74 does not contain the complete symmetric digraph on $k\ge \vec{\chi}(D)$75 vertices, then $k\ge \vec{\chi}(D)$76 admits a $k\ge \vec{\chi}(D)$77-measurable $k\ge \vec{\chi}(D)$78-dicoloring for every Borel probability measure $k\ge \vec{\chi}(D)$79, and a $k\ge \vec{\chi}(D)$80-Baire-measurable $k\ge \vec{\chi}(D)$81-dicoloring for every compatible Polish topology $k\ge \vec{\chi}(D)$82 (Higgins, 2024). The same work proves a definable Gallai theorem: bounded-degree Borel digraphs with no Gallai-tree component are Borel degree-list-dicolorable (Higgins, 2024).

These results show that the dicoloring paradigm now spans several regimes:

Regime	Typical question	Representative result
Finite extremal	How large can $k\ge \vec{\chi}(D)$83 be under degree and obstruction constraints?	Large-$k\ge \vec{\chi}(D)$84 $k\ge \vec{\chi}(D)$85-dicoloring theorems (Harutyunyan et al., 14 Jul 2025)
Reconfiguration	Is $k\ge \vec{\chi}(D)$86 connected, and what is its diameter?	Circulant tournament classifications (Cordero-Michel et al., 6 Oct 2025)
Planar decomposition	When does a planar orientation admit a $k\ge \vec{\chi}(D)$87-dicoloring?	CAI-based sufficient conditions and counterexamples (Cambie et al., 2024)
Descriptive	Can dicolorings be chosen measurably or Baire-measurably?	Measurable Brooks theorem for digraphs (Higgins, 2024)

A plausible implication is that “dicoloring graph” has become a nexus term joining three traditions: directed coloring proper, reconfiguration theory, and structural/definable extensions of Brooks- and Gallai-type theorems.

8. Significance, limitations, and current outlook

The study of dicoloring graphs has clarified that the directed analogue of coloring inherits some but not all of the structure of ordinary graph coloring. The finite existence theory now includes large-degree Brooks- and Borodin–Kostochka-type theorems with sharp directed obstructions (Harutyunyan et al., 14 Jul 2025). Reconfiguration theory has shown that the space of acyclic colorings can be explicitly analyzable on structured families, yet dichromatic number alone does not control its connectivity (Cordero-Michel et al., 6 Oct 2025). Planar and descriptive variants further demonstrate that acyclic color-class constraints interact fruitfully with topology, planarity, and definability (Cambie et al., 2024, Higgins, 2024).

Several misconceptions are now untenable. It is false that biclique obstructions alone explain high dichromatic number in large-degree digraphs, because the exceptional configuration $k\ge \vec{\chi}(D)$88 must also be excluded (Harutyunyan et al., 14 Jul 2025). It is also false that increasing $k\ge \vec{\chi}(D)$89 as a function of $k\ge \vec{\chi}(D)$90 must eventually make $k\ge \vec{\chi}(D)$91 connected; no such universal function exists (Cordero-Michel et al., 6 Oct 2025). And in descriptive settings, a Borel Brooks theorem fails even where measurable and Baire-measurable versions remain valid (Higgins, 2024).

The present state of the subject suggests two broad tendencies. First, structural dicoloring theory is converging on a refined obstruction-based picture, with different degree parameters—$k\ge \vec{\chi}(D)$92, $k\ge \vec{\chi}(D)$93, and $k\ge \vec{\chi}(D)$94—supporting distinct but related theorems (Harutyunyan et al., 14 Jul 2025). Second, reconfiguration theory is identifying families where $k\ge \vec{\chi}(D)$95 can be described exactly, including cycle structure, isolated vertices, and explicit diameter bounds (Cordero-Michel et al., 6 Oct 2025). Together these developments place the dicoloring graph at the center of a rapidly maturing theory of directed coloring.