On graphs whose domination number is equal to chromatic and dominator chromatic numbers

David A. Kalarkop, Pawaton Kaemawichanurat, Raghavachar Rangarajan

For a graph $G=(V(G),E(G))$, a dominating set $D$ is a vertex subset of $V(G)$ in which every vertex of $V(G)\setminus D$ is adjacent to a vertex in $D$. The domination number…