Distinguishing Chromatic Number

• Distinguishing Chromatic Number is defined as the minimum number of colors in a proper vertex coloring that is preserved only by the identity automorphism, thus refining the traditional chromatic number.
• It connects graph coloring, automorphism groups, and homomorphism theory by using symmetric-breaking colorings and has been studied in various finite and infinite graph families.
• Analytical bounds are derived via methods such as BFS-based ordering, forbidden subgraph techniques, and module decompositions, offering precise results for special graph classes.

The distinguishing chromatic number of a graph $G$, denoted $\chi_D(G)$, is the minimum number of colors in a proper vertex coloring that is preserved only by the identity automorphism. It refines the chromatic number by imposing simultaneous properness and symmetry breaking, and it sits at the intersection of graph coloring, automorphism groups, metric graph theory, homomorphism theory, and structural graph classes. The parameter has been studied on finite and infinite graphs, on highly symmetric families such as circulants and Cayley graphs, and on graphs derived from subdivision operations, with both sharp general bounds and detailed exact classifications now available (Korivand et al., 2021, Imrich et al., 2019, Banerjee et al., 2024).

1. Definition and basic framework

For a graph $G$, a proper $k$-coloring is a map $c:V(G)\to\{1,\dots,k\}$ such that adjacent vertices receive distinct colors. The distinguishing chromatic number is

$$\chi_D(G)=\min\{k:\exists\ \text{a proper }k\text{-coloring preserved only by the identity automorphism}\}.$$

Equivalently, $\chi_D(G)$ is the least $k$ for which $G$ admits a proper coloring whose color classes are preserved only by the identity element of $\operatorname{Aut}(G)$ (Korivand et al., 2021).

Two basic inequalities are immediate. Because a distinguishing proper coloring is, in particular, a proper coloring, one always has $\chi_D(G)$0. Because a distinguishing proper coloring is also a distinguishing coloring without the properness constraint, one also has $\chi_D(G)$1, where $\chi_D(G)$2 is the distinguishing number (Bonato et al., 2013, 0907.0691).

The parameter is sensitive to residual symmetry after proper coloring. If $\chi_D(G)$3, then every proper coloring is automatically distinguishing, so $\chi_D(G)$4 (Collins et al., 2012). At the opposite extreme, complete multipartite graphs are exactly the graphs with $\chi_D(G)$5 (Korivand et al., 2021). This includes complete graphs and complete bipartite graphs such as $\chi_D(G)$6 and $\chi_D(G)$7.

A useful reformulation comes from homomorphism theory: a distinguishing proper $\chi_D(G)$8-coloring is exactly a distinguishing homomorphism to $\chi_D(G)$9 (Bonato et al., 2013). This viewpoint connects $G$0 to broader symmetry-breaking constructions on infinite graphs and to upper bounds derived from homomorphic embeddings.

The gap between $G$1 and $G$2 can be large. For the star $G$3, the leaves can be permuted arbitrarily, so $G$4, while properness forces the center to receive a color different from all leaves, giving $G$5 for $G$6 (0907.0691).

2. Relation to locating colorings and metric structure

A central structural comparison identifies $G$7 as the weaker of two proper coloring parameters based on symmetry breaking and metric distinguishability. For a proper coloring $G$8 with color classes $G$9, the color code of a vertex $k$0 is

$k$1

A proper coloring is locating if distinct vertices have distinct color codes, and the minimum number of colors in such a coloring is the locating chromatic number $k$2 (Korivand et al., 2021).

For every connected graph, any locating coloring is distinguishing. Consequently,

$k$3

This implies that any upper bound on $k$4 is also an upper bound on $k$5, and any lower bound on $k$6 is also a lower bound on $k$7 (Korivand et al., 2021).

The comparison is strict at the level of colorings. On the path $k$8 with vertices $k$9, the proper coloring with classes $c:V(G)\to\{1,\dots,k\}$0, $c:V(G)\to\{1,\dots,k\}$1, and $c:V(G)\to\{1,\dots,k\}$2 is distinguishing but not locating, since $c:V(G)\to\{1,\dots,k\}$3. Nevertheless, the parameters still coincide on this graph: $c:V(G)\to\{1,\dots,k\}$4 (Korivand et al., 2021).

The locating-coloring comparison yields additional bounds. If $c:V(G)\to\{1,\dots,k\}$5 is the metric dimension, then $c:V(G)\to\{1,\dots,k\}$6, hence

$c:V(G)\to\{1,\dots,k\}$7

If $c:V(G)\to\{1,\dots,k\}$8 has order $c:V(G)\to\{1,\dots,k\}$9 and $$\chi_D(G)=\min\{k:\exists\ \text{a proper }k\text{-coloring preserved only by the identity automorphism}\}.$$0, then

$$\chi_D(G)=\min\{k:\exists\ \text{a proper }k\text{-coloring preserved only by the identity automorphism}\}.$$1

For complete multipartite graphs, the two parameters coincide maximally: $$\chi_D(G)=\min\{k:\exists\ \text{a proper }k\text{-coloring preserved only by the identity automorphism}\}.$$2 More generally, for every pair of integers $$\chi_D(G)=\min\{k:\exists\ \text{a proper }k\text{-coloring preserved only by the identity automorphism}\}.$$3, there exists a graph $$\chi_D(G)=\min\{k:\exists\ \text{a proper }k\text{-coloring preserved only by the identity automorphism}\}.$$4 with $$\chi_D(G)=\min\{k:\exists\ \text{a proper }k\text{-coloring preserved only by the identity automorphism}\}.$$5 and $$\chi_D(G)=\min\{k:\exists\ \text{a proper }k\text{-coloring preserved only by the identity automorphism}\}.$$6, so the gap $$\chi_D(G)=\min\{k:\exists\ \text{a proper }k\text{-coloring preserved only by the identity automorphism}\}.$$7 can realize every value from $$\chi_D(G)=\min\{k:\exists\ \text{a proper }k\text{-coloring preserved only by the identity automorphism}\}.$$8 to $$\chi_D(G)=\min\{k:\exists\ \text{a proper }k\text{-coloring preserved only by the identity automorphism}\}.$$9 (Korivand et al., 2021).

The equality problem remains open in general. The class of graphs satisfying $\chi_D(G)$0 is not characterized, although there are complete descriptions when both parameters equal $\chi_D(G)$1. For trees, $\chi_D(G)$2 exactly for those $\chi_D(G)$3 in the Baskoro–Asmiati family $\chi_D(G)$4 with $\chi_D(G)$5. For graphs containing cycles, the same equality holds for the Asmiati–Baskoro family $\chi_D(G)$6 when either the graph is bipartite with $\chi_D(G)$7, or it is non-bipartite (Korivand et al., 2021).

3. General bounds and hereditary graph classes

The universal finite-graph bound due to Collins and Trenk is

$\chi_D(G)$8

for every connected graph $\chi_D(G)$9, with equality only for $k$0 and $k$1. Much of the later literature shows that this upper bound can be reduced substantially under structural restrictions such as large girth or forbidden induced subgraphs (Cranston, 2017, Brause et al., 22 May 2025).

The following bounds are explicitly established for connected finite graphs.

Graph class	Bound on $k$2	Equality information
Girth at least $k$3, $k$4	$k$5	Stars show sharpness
Bipartite, girth at least $k$6, $k$7	$k$8	Includes trees and unicyclic extensions
$k$9-free	$G$0	Equality iff $G$1
Chordal	$G$2	Equality iff $G$3 is symmetric or $G$4
$G$5-free	$G$6	Equality iff $G$7 or $G$8
$G$9-free	$\operatorname{Aut}(G)$0	Equality iff $\operatorname{Aut}(G)$1 is complete or balanced complete bipartite
Claw-free	$\operatorname{Aut}(G)$2	Also $\operatorname{Aut}(G)$3, equality iff $\operatorname{Aut}(G)$4 or $\operatorname{Aut}(G)$5
$\operatorname{Aut}(G)$6-free	$\operatorname{Aut}(G)$7 unless $\operatorname{Aut}(G)$8	If also $\operatorname{Aut}(G)$9-free, then $\chi_D(G)$00

These results combine BFS-based fixing arguments, simplicial-vertex reductions, dominating-clique structure, module decompositions, and line-graph translations (Cranston, 2017, Alikhani et al., 2017, Brause et al., 22 May 2025).

Large girth is especially effective. For connected graphs of girth at least $\chi_D(G)$01, a BFS-order greedy coloring yields $\chi_D(G)$02 except for $\chi_D(G)$03 (Cranston, 2017). In the bipartite girth-at-least-$\chi_D(G)$04 case, the absence of $\chi_D(G)$05-, $\chi_D(G)$06-, and $\chi_D(G)$07-cycles gives strong neighborhood separation across BFS layers, which again forces $\chi_D(G)$08 (Alikhani et al., 2017).

Forbidden induced subgraphs lead to sharper hereditary-class theorems. In particular, connected $\chi_D(G)$09-free graphs satisfy $\chi_D(G)$10, with $\chi_D(G)$11 as the unique equality case. Chordal graphs satisfy $\chi_D(G)$12, and the equality cases are completely characterized by symmetric constructions and joins of the form $\chi_D(G)$13 (Brause et al., 22 May 2025).

A distinct line of work studies list versions. If $\chi_D(G)$14 is $\chi_D(G)$15-connected, $\chi_D(G)$16, $\chi_D(G)$17, and $\chi_D(G)$18 contains no induced $\chi_D(G)$19 or $\chi_D(G)$20, then

$\chi_D(G)$21

In particular, when $\chi_D(G)$22 and $\chi_D(G)$23, one obtains

$\chi_D(G)$24

and since $\chi_D(G)$25, the same upper bounds transfer to $\chi_D(G)$26 (Banerjee, 15 Sep 2025).

4. Exact values on classical and derived families

Several classical families admit exact formulas. For cycles,

$\chi_D(G)$27

For odd paths $\chi_D(G)$28, one has $\chi_D(G)$29, $\chi_D(G)$30, $\chi_D(G)$31, and consequently $\chi_D(G)$32 (Korivand et al., 2021, Barrus et al., 2023).

Complete multipartite graphs form the maximal regime: $\chi_D(G)$33 Thus $\chi_D(G)$34 and $\chi_D(G)$35 require $\chi_D(G)$36 colors in distinguishing proper colorings (Korivand et al., 2021).

Hamiltonian circulant graphs of maximum degree at most $\chi_D(G)$37 provide a large exact classification. For Möbius ladders,

$\chi_D(G)$38

For all $\chi_D(G)$39,

$\chi_D(G)$40

and by isomorphism the same holds for $\chi_D(G)$41. For wreath graphs,

$\chi_D(G)$42

Outside a controlled list of arithmetic and small-order exceptions, most tetravalent $\chi_D(G)$43 satisfy $\chi_D(G)$44, while exceptional cases include $\chi_D(G)$45, $\chi_D(G)$46, and $\chi_D(G)$47 (Barrus et al., 2023).

Subdivision-derived constructions also admit exact or near-exact formulas. For the middle graph $\chi_D(G)$48 of a connected graph $\chi_D(G)$49 of order at least $\chi_D(G)$50,

$\chi_D(G)$51

The proof uses the identity $\chi_D(G)$52, where $\chi_D(G)$53 is the endline graph, together with results on distinguishing chromatic indices of line graphs (Banerjee et al., 2024).

For subdivision graphs $\chi_D(G)$54, the sharp statements are conditional on the base graph. If $\chi_D(G)$55 is not a cycle and $\chi_D(G)$56, then

$\chi_D(G)$57

and this bound is sharp. If $\chi_D(G)$58 is not a cycle and $\chi_D(G)$59, then $\chi_D(G)$60. If $\chi_D(G)$61, then $\chi_D(G)$62. For cycles,

$\chi_D(G)$63

with the distinction that in the first case this equals $\chi_D(G)$64, and in the second it equals $\chi_D(G)$65 (Banerjee et al., 2024).

5. Infinite graphs, homomorphisms, and probabilistic models

On infinite graphs, the homomorphism perspective becomes especially powerful. A homomorphism $\chi_D(G)$66 is distinguishing if the only automorphism of $\chi_D(G)$67 preserving every fiber $\chi_D(G)$68 is the identity. Distinguishing proper colorings are exactly distinguishing homomorphisms to complete graphs (Bonato et al., 2013).

For connected existentially closed graphs, Bonato and Delić prove a strong existence theorem: if $\chi_D(G)$69 is c.e.c. and $\chi_D(G)$70, then there are $\chi_D(G)$71 distinct distinguishing homomorphisms

$\chi_D(G)$72

As a corollary,

$\chi_D(G)$73

and in particular $\chi_D(G)$74 under the same hypotheses (Bonato et al., 2013).

A separate degree-based theory applies to connected infinite graphs with finite maximum degree. One has

$\chi_D(G)$75

This bound is sharp for $\chi_D(G)$76, since the double ray has $\chi_D(G)$77. For infinite trees with finite maximum degree $\chi_D(G)$78, the stronger bound $\chi_D(G)$79 holds, and if the tree is locally finite with infinite motion, then $\chi_D(G)$80. More generally, connected subcubic graphs with infinite motion satisfy $\chi_D(G)$81 (Imrich et al., 2019).

These infinite-motion results reflect a recurring principle: low-color symmetry breaking becomes possible when nontrivial automorphisms move infinitely many vertices. The ray has $\chi_D(G)$82, the double ray has $\chi_D(G)$83, and infinite $\chi_D(G)$84-regular trees with $\chi_D(G)$85 satisfy $\chi_D(G)$86 (Imrich et al., 2019).

Random Cayley graphs provide a probabilistic counterpart. For random inverse-closed Cayley graphs $\chi_D(G)$87 over finite abelian groups of Type I, where $\chi_D(G)$88, and of Type II, where $\chi_D(G)$89 with $\chi_D(G)$90 odd-order and non-cyclic, the paper proves that in the stated $\chi_D(G)$91-ranges,

$\chi_D(G)$92

with probability at least $\chi_D(G)$93 (Balachandran et al., 2014). The argument combines asymptotically minimal automorphism groups with either an independent triple not stabilized by any nontrivial automorphism or a motion-lemma refinement inside a largest color class.

6. Algorithmic, list, and cross-domain extensions

The computational complexity of $\chi_D(G)$94 depends sharply on the target number of colors. For $\chi_D(G)$95, deciding whether $\chi_D(G)$96 is NP-hard. For $\chi_D(G)$97, the problem is at least as hard as Graph Automorphism and no harder than Graph Isomorphism: the connected-case decision problem is many-one equivalent to Graph Automorphism, and the general decision problem is polynomial-time Turing reducible to Graph Isomorphism (0907.0691).

Trees form a tractable and unusually rigid class. For every tree $\chi_D(G)$98,

$\chi_D(G)$99

The proofs rely on recursive counts of inequivalent distinguishing colorings over isomorphism classes of rooted child subtrees, extending Cheng’s enumerative technique. The resulting dynamic programs compute both $G$00 and $G$01 in $G$02 time, and they characterize exactly when the upper bound $G$03 is attained (Ferrara et al., 2011).

The parameter also satisfies a Nordhaus–Gaddum-type inequality. For every graph $G$04 of order $G$05,

$G$06

This yields the product bound

$G$07

Equality cases are studied through NGD-graphs, and the classical NG-graph structure can be recognized in polynomial time via a degree-based partition into the sets $G$08, $G$09, and $G$10 defined by degrees relative to $G$11 (Collins et al., 2012).

Several extensions preserve the same symmetry-breaking philosophy while changing the underlying combinatorial object. For oriented graphs, the extremal oriented distinguishing chromatic number $G$12 or $G$13 is known for paths, cycles, complete graphs, and complete bipartite graphs. For example,

$G$14

and for balanced complete bipartite graphs,

$G$15

(Meslem et al., 2019).

For posets, properness is reinterpreted by requiring comparable points to receive distinct colors. The resulting distinguishing chromatic number $G$16 satisfies $G$17, where $G$18 is the comparability graph, but the gap can be arbitrarily large. In distributive lattices $G$19, one has

$G$20

and for Boolean lattices,

$G$21

(Collins et al., 2019).

Taken together, these results show that $G$22 is not merely a chromatic invariant with an automorphism constraint. It is a structural measure of how much proper coloring must be refined to destroy symmetry, and its behavior is governed by the interplay among local degree, global automorphism structure, metric distinguishability, homomorphic codings, and class-specific decomposition theorems.