A Domatic Analogue of $\chi$-Bounded Graph Classes and the Gyárfás-Sumner Conjecture

Quentin Chuet, Selma Djelloul, Hoang La +2

Given a graph $G$, a dominating set is a subset $X\subseteq V(G)$ such that $N[X]=V(G)$. The \emph{domatic number} of $G$, denoted $\mathrm{dom}(G)$, is the maximum size of a partitio…