
strong coloring
Strong colorability ★★★
Author(s): Aharoni; Alon; Haxell
Let be a positive integer. We say that a graph
is strongly
-colorable if for every partition of the vertices to sets of size at most
there is a proper
-coloring of
in which the vertices in each set of the partition have distinct colors.
Conjecture If
is the maximal degree of a graph
, then
is strongly
-colorable.




Keywords: strong coloring
