Coloring entropy weight
= Coloring entropy weight
{title2=$w(G)=|V(G)|\min_\chi H(\chi(Z))$}
For a uniformly chosen vertex $Z$, minimize the <information entropy> of its color over proper colorings. Multiply by the number of vertices to define this weight. Minimizing the color entropy gives the strongest contribution from that graph in the <entropy weight of a graph cover> inequality.