The chromatic discrepancy of graphs

N. R. Aravind, Subrahmanyam Kalyanasundaram, R. B. Sandeep +1

For a proper vertex coloring $c$ of a graph $G$, let ${\phi }_c(G)$ denote the maximum, over all induced subgraphs $H$ of $G$, the difference between the chromatic number $\chi (H)$ and the…