Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001110
(load all 2 compositions to match this statistic)
Mapping
St001110: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => 1
([],2)
 => 1
([(0,1)],2)
 => 2
([],3)
 => 1
([(1,2)],3)
 => 2
([(0,2),(1,2)],3)
 => 3
([(0,1),(0,2),(1,2)],3)
 => 3
([],4)
 => 1
([(2,3)],4)
 => 2
([(1,3),(2,3)],4)
 => 3
([(0,3),(1,3),(2,3)],4)
 => 4
([(0,3),(1,2)],4)
 => 2
([(0,3),(1,2),(2,3)],4)
 => 3
([(1,2),(1,3),(2,3)],4)
 => 3
([(0,3),(1,2),(1,3),(2,3)],4)
 => 4
([(0,2),(0,3),(1,2),(1,3)],4)
 => 4
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4
([],5)
 => 1
([(3,4)],5)
 => 2
([(2,4),(3,4)],5)
 => 3
([(1,4),(2,4),(3,4)],5)
 => 4
([(0,4),(1,4),(2,4),(3,4)],5)
 => 4
([(1,4),(2,3)],5)
 => 2
([(1,4),(2,3),(3,4)],5)
 => 3
([(0,1),(2,4),(3,4)],5)
 => 3
([(2,3),(2,4),(3,4)],5)
 => 3
([(0,4),(1,4),(2,3),(3,4)],5)
 => 4
([(1,4),(2,3),(2,4),(3,4)],5)
 => 4
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => 4
([(1,3),(1,4),(2,3),(2,4)],5)
 => 4
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => 4
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => 4
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => 5
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4
([(0,4),(1,3),(2,3),(2,4)],5)
 => 3
([(0,1),(2,3),(2,4),(3,4)],5)
 => 3
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => 4
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => 4
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 5
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => 5
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 4
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => 4
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => 5
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => 5
Description
The 3-dynamic chromatic number of a graph. A $k$-dynamic coloring of a graph $G$ is a proper coloring of $G$ in such a way that each vertex $v$ sees at least $\min\{d(v), k\}$ colors in its neighborhood. The $k$-dynamic chromatic number of a graph is the smallest number of colors needed to find an $k$-dynamic coloring. This statistic records the $3$-dynamic chromatic number of a graph.