On Grundy total domination number in product graphs

Boštjan Brešar, Csilla Bujtás, Tanja Gologranc +6

A longest sequence $(v_1,\dots ,v_k)$ of vertices of a graph $G$ is a Grundy total dominating sequence of $G$ if for all $i$, $N(v_i) \setminus \bigcup_{j=1}^{i-1}N(v_j)\not=\empty…