Counting subgraphs of coloring graphs

Shamil Asgarli, Sara Krehbiel, Howard W. Levinson +1

The chromatic polynomial $\ddot{I}{€}_G(k)$ of a graph $G$ can be viewed as counting the number of vertices in a family of coloring graphs ${\mathcal{C}}_k(G)$ associated with (proper) $k$-c…