List-Distinguishing Chromatic Number

• List-Distinguishing Chromatic Number is a graph parameter defined as the minimum list size required to achieve a proper distinguishing coloring, ensuring every nontrivial automorphism is broken.
• It unifies concepts from proper list coloring and symmetry breaking, with exact evaluations available for trees, paths, cycles, and other standard graph families through enumerative and constructive methods.
• Recent studies establish Brooks-type and refined upper bounds by leveraging structural decompositions, connectivity assumptions, and automorphism-group properties to characterize these chromatic constraints.

The list-distinguishing chromatic number is a list-constrained symmetry-breaking coloring parameter for finite simple graphs. In the now-standard usage of recent work, it is the minimum $k$ such that every list assignment of size $k$ admits a proper distinguishing coloring, denoted $\chi_{D_\ell}(G)$ or $\chi_{D_L}(G)$; a parallel nonproper parameter, the list distinguishing number $D_\ell(G)$, asks only for a distinguishing labeling from the lists. A notable terminological divergence is that "Characterization of graphs with distinguishing number equal list distinguishing number" (Alikhani et al., 2017) explicitly uses the phrase “List-Distinguishing Chromatic Number” for the nonproper parameter $D_\ell(G)$, whereas later papers use it for the proper parameter $\chi_{D_\ell}(G)$. Across both conventions, the theory studies how list constraints interact with graph automorphisms, proper coloring, and structural restrictions on the graph class (Alikhani et al., 2017, Banerjee et al., 2024, Banerjee, 15 Sep 2025).

1. Parameter landscape and notation

Let $\operatorname{Aut}(G)$ denote the automorphism group of a graph $G$. A vertex coloring $f$ is distinguishing if every nontrivial automorphism fails to preserve it; equivalently, the identity is the only automorphism preserving all vertex colors. If the coloring is also proper, it is a proper distinguishing coloring. Given a list assignment $k$0, one asks whether the colors can be chosen from the prescribed lists while still breaking all nontrivial automorphisms (Banerjee et al., 2024, Banerjee, 15 Sep 2025).

The four parameters that recur in the literature are the distinguishing number $k$1, the list distinguishing number $k$2, the distinguishing chromatic number $k$3, and the list-distinguishing chromatic number $k$4. The first pair ignores properness; the second pair requires it. In the notation of (Banerjee et al., 2024), $k$5 and $k$6 are the same parameters written with $k$7 rather than $k$8.

Parameter	Meaning	Basic relation
$k$9	minimum number of colors in a distinguishing coloring	$\chi_{D_\ell}(G)$0
$\chi_{D_\ell}(G)$1	minimum $\chi_{D_\ell}(G)$2 such that every $\chi_{D_\ell}(G)$3-list assignment is distinguishable	nonproper list analogue
$\chi_{D_\ell}(G)$4	minimum number of colors in a proper distinguishing coloring	$\chi_{D_\ell}(G)$5
$\chi_{D_\ell}(G)$6	minimum $\chi_{D_\ell}(G)$7 such that every $\chi_{D_\ell}(G)$8-list assignment is properly distinguishable	$\chi_{D_\ell}(G)$9

The basic inequalities are immediate from the definitions. For the nonproper parameters, identical lists show that $\chi_{D_L}(G)$0 (Alikhani et al., 2017). For the proper parameters, the recent literature records

$\chi_{D_L}(G)$1

and also

$\chi_{D_L}(G)$2

in the notation of (Banerjee et al., 2024). These inequalities locate list-distinguishing chromatic number at the intersection of list coloring and symmetry breaking: it refines proper list coloring by requiring that the resulting coloring eliminate every nontrivial automorphism.

A common source of confusion is the distinction between $\chi_{D_L}(G)$3 and $\chi_{D_L}(G)$4. The former is a list version of the distinguishing number and does not impose properness; the latter is the proper list-distinguishing parameter. The literature now treats them separately, but the earlier terminology in (Alikhani et al., 2017) shows that the phrase itself has not been historically uniform.

2. Trees and the enumerative foundation

Trees provide the most complete structural theory currently available. "List Distinguishing Parameters of Trees" (Ferrara et al., 2011) develops an enumerative method, extending Cheng’s recursion, and proves that for every tree $\chi_{D_L}(G)$5,

$\chi_{D_L}(G)$6

Thus, for trees, passing to lists does not increase either the nonproper or the proper symmetry-breaking requirement.

The framework is rooted-tree based. After rooting at the center, or subdividing a central edge when the center is an edge, one studies a rooted subtree $\chi_{D_L}(G)$7 by partitioning the children of $\chi_{D_L}(G)$8 into classes $\chi_{D_L}(G)$9 according to rooted-subtree isomorphism. If $D_\ell(G)$0 is a representative of $D_\ell(G)$1, Cheng’s recursion for distinguishing colorings is

$D_\ell(G)$2

The proper analogue counts proper distinguishing colorings with a prescribed root color $D_\ell(G)$3: $D_\ell(G)$4 These formulas encode the local obstruction: at each vertex, isomorphic child subtrees must receive inequivalent colorings, and in the proper case those colorings must also avoid the parent’s color.

The list extension is a monotonicity statement at the level of equivalence classes. For a list assignment $D_\ell(G)$5 with $D_\ell(G)$6 for all vertices of a rooted tree, the paper proves

$D_\ell(G)$7

with equality precisely in orbit-constant situations or when no such coloring exists. The proper version similarly shows

$D_\ell(G)$8

for all $D_\ell(G)$9. These inequalities are the core reason that list constraints do not raise the tree parameters.

The tree theory also yields a certificate for when properness costs exactly one additional color. If $D_\ell(G)$0, then $D_\ell(G)$1 if and only if either $D_\ell(G)$2 and $D_\ell(G)$3, or there is a vertex $D_\ell(G)$4 and a set $D_\ell(G)$5 of children of $D_\ell(G)$6 whose rooted subtrees are all isomorphic and satisfy

$D_\ell(G)$7

This criterion isolates the precise combinatorial bottleneck: too many equivalent branches relative to the number of inequivalent proper colorings available beneath them.

3. Exact values on standard graph families

Several graph classes admit exact evaluations of $D_\ell(G)$8 or $D_\ell(G)$9. The clearest examples are paths, cycles, trees, book graphs, friendship graphs, and certain complete bipartite graphs (Banerjee et al., 2024, Alikhani et al., 2017).

For paths, (Banerjee et al., 2024) proves

$\chi_{D_\ell}(G)$0

For cycles, the same paper gives

$\chi_{D_\ell}(G)$1

together with

$\chi_{D_\ell}(G)$2

The exceptional behavior of $\chi_{D_\ell}(G)$3 and $\chi_{D_\ell}(G)$4 reflects the interaction between proper 2-colorability or 3-colorability and the residual dihedral symmetries that remain unless additional colors are introduced.

For trees, the exact identification is universal: $\chi_{D_\ell}(G)$5 for every tree $\chi_{D_\ell}(G)$6 (Ferrara et al., 2011). This is one of the central positive results in the area and remains a benchmark for more general classes.

Book graphs and friendship graphs show that the proper and nonproper list parameters can diverge sharply. If $\chi_{D_\ell}(G)$7, then (Alikhani et al., 2017) proves

$\chi_{D_\ell}(G)$8

For the proper parameter, (Banerjee et al., 2024) proves that if $\chi_{D_\ell}(G)$9 and $\operatorname{Aut}(G)$0, then

$\operatorname{Aut}(G)$1

when $\operatorname{Aut}(G)$2, whereas

$\operatorname{Aut}(G)$3

when $\operatorname{Aut}(G)$4. Thus the list-distinguishing chromatic number of a book graph is determined exactly and agrees with the non-list proper parameter, but exceeds the nonproper list-distinguishing number by either $\operatorname{Aut}(G)$5 or $\operatorname{Aut}(G)$6.

For friendship graphs $\operatorname{Aut}(G)$7, (Alikhani et al., 2017) proves

$\operatorname{Aut}(G)$8

while (Banerjee et al., 2024) states

$\operatorname{Aut}(G)$9

This is a clean instance where properness adds exactly one color over the distinguishing number and its list version.

The sharp exceptional complete bipartite case is

$G$0

which is one of the two universal exceptions in the Brooks-type theory discussed below (Banerjee et al., 2024, Banerjee, 15 Sep 2025).

4. Universal upper bounds and constructive methods

A central theme of the recent theory is that the classical Collins–Trenk upper bound for distinguishing chromatic number persists in the list setting. Both (Banerjee et al., 2024) and (Banerjee, 15 Sep 2025) record the list analogue: $G$1 for every connected graph $G$2, while

$G$3

for $G$4. This is the basic Brooks-type theorem for the list-distinguishing chromatic number.

"Upper bounds for the list-distinguishing chromatic number" (Banerjee et al., 2024) gives a constructive proof by adapting the BFS-rooted method of Imrich et al. to finite graphs. One chooses a root $G$5 of maximum degree, builds a BFS spanning tree, colors $G$6 and its neighborhood with distinct colors from lists of size $G$7, and then proceeds in BFS order. Whenever another vertex acquires the same “uniquely colored” role as the root, a local recoloring among siblings and nearby vertices destroys that symmetry while preserving properness and list feasibility. The output is a proper $G$8-distinguishing coloring unless the graph is one of the two sharp exceptions.

The same paper proves several additional general bounds. For connected unicyclic graphs of girth at least $G$9 with $f$0,

$f$1

More broadly, if $f$2 is the coloring number and $f$3 the list-distinguishing number, then

$f$4

This bound arises from a list-splitting argument along an ordering witnessing $f$5: disjoint sublists are carved out to guarantee properness, and the residual list capacity is used to break automorphisms.

Automorphism-group structure also yields upper bounds. If $f$6 for a prime $f$7, then

$f$8

and the paper states that this bound is sharp. More generally, if

$f$9

then

$k$00

again with sharpness. These results separate the cost of proper list coloring from the additional cost of breaking cyclic $k$01-group factors in the automorphism group.

A basic misconception is that list constraints never increase the proper symmetry-breaking parameter. This is false. The recent literature records both a connected graph $k$02 with $k$03 and a bipartite asymmetric graph with $k$04 but $k$05 because some 2-element list assignments admit no proper coloring (Banerjee et al., 2024, Banerjee, 15 Sep 2025).

5. Structural refinements: decompositions and small complete bigraphs

After the universal $k$06 bound, the next development is a family of sharper bounds under connectivity and forbidden-subgraph hypotheses. The first refinement, in (Banerjee et al., 2024), uses Lovász’s decomposition lemma. If $k$07, $k$08 is an $k$09-connected graph of order $k$10, and $k$11 contains no $k$12, then

$k$13

The argument partitions $k$14 into subgraphs of controlled maximum degree and colors those parts from disjoint palettes; the disjointness forces global properness and helps preserve distinguishability across the partition.

"The List-distinguishing chromatic number of graphs containing only small complete bigraphs" (Banerjee, 15 Sep 2025) strengthens this direction. For $k$15, if $k$16 is $k$17-connected with $k$18 and has no induced $k$19 or $k$20, then

$k$21

This is strictly stronger than $k$22 whenever $k$23, and it simplifies to

$k$24

whenever $k$25.

The proof is Catlin-inspired rather than Lovász-based. It partitions the vertex set into blocks $k$26 maximizing

$k$27

with a secondary minimization of induced $k$28 inside the $k$29-blocks. A vertex-shifting argument yields $k$30, and a key subclaim excludes induced $k$31 inside the critical blocks, since repeated shifts would create a forbidden induced $k$32. The final assembly uses pairwise disjoint color blocks and the inequality

$k$33

The paper then applies the theorem to joins $k$34 where $k$35 is drawn from three explicit graph families: Paley graphs $k$36, Cayley graphs on dihedral groups $k$37, and circulant Cayley graphs $k$38. Menger’s theorem supplies the required connectivity, while Hoffman’s ratio bound and direct clique arguments bound independence numbers to exclude the forbidden induced complete bigraphs. For the parameter ranges stated in the paper, these families satisfy $k$39, hence $k$40, so the general theorem yields the clean improvement

$k$41

6. Characterization theory and open directions

The most explicit characterization in the literature concerns the nonproper list parameter $k$42. In (Alikhani et al., 2017), let $k$43, let $k$44, and let $k$45 be the set of all distinguishing labelings using labels in $k$46, where $k$47. Each distinguishing labeling $k$48 generates a family of $k$49-related list sequences, and the union of these families is denoted

$k$50

The paper proves that a list sequence $k$51 with $k$52 and $k$53 admits a distinguishing $k$54-labeling if and only if it lies in this union. Consequently,

$k$55

and in particular

$k$56

if and only if the same covering inequality holds for all $k$57.

This set-theoretic viewpoint is accompanied by two counting tools. One is an inclusion–exclusion formula for $k$58, expressed in terms of overlap statistics among the families generated by different distinguishing labelings. The other is a recurrence relating $k$59 to $k$60 and $k$61 by separating the lists that do and do not contain a new color. The paper then shows that the same characterization scheme extends to $k$62 and to the ordinary list chromatic number $k$63: in both cases, the list parameter is the minimum $k$64 for which the union of compatible list sequences covers all $k$65 assignments for every $k$66 (Alikhani et al., 2017).

Two open themes persist. First, the question recalled from Ferrara et al.—whether there exists a graph $k$67 with $k$68—remains unresolved in (Alikhani et al., 2017). Second, (Banerjee et al., 2024) asks whether there exists a graph $k$69 such that

$k$70

and $k$71 is not asymmetric. The recent structural work in (Banerjee, 15 Sep 2025) also leaves several natural directions: extending the improved bounds to $k$72, weakening the connectivity assumptions, determining when the $k$73 bound or the general floor-based bound is tight, and understanding algorithmic aspects of finding or certifying the required Catlin-style extremal partition.

Taken together, the current theory shows a sharp contrast between the nonproper and proper list settings. For trees and several classical graph families, equality with the non-list parameter survives list constraints. For proper colorings in general, however, list constraints can raise the required number of colors, and the strongest known progress consists of universal Brooks-type bounds, exact values on selected families, and increasingly refined improvements under strong structural hypotheses.