Howard W. Levinson

collaborators

2 papers

math.CO2026

Coloring graphs as complete graph invariants

Shamil Asgarli, Sara Krehbiel, Howard W. Levinson

We investigate the extent to which the $k$ -coloring graph $C_{k} (G)$ uniquely determines the base graph $G$ and the number of colors $k$ . The vertices of $\mathcal{C}_{k}…

math.CO2025

Counting subgraphs of coloring graphs

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

The chromatic polynomial $I ¨ _{G} (k)$ of a graph $G$ can be viewed as counting the number of vertices in a family of coloring graphs $C_{k} (G)$ associated with (proper) $k$ -c…