Perfectly Colorable Graphs

R B Sandeep

We define a perfect coloring of a graph $G$ as a proper coloring of $G$ such that every connected induced subgraph $H$ of $G$ uses exactly $\omega (H)$ many colors where $\omega (H)$ is the cl…