Computation of Grundy dominating sequences in (co-)bipartite graphs

Boštjan Brešar, Arti Pandey, Gopika Sharma

A sequence $S$ of vertices of a graph $G$ is called a dominating sequence of $G$ if $(i)$ each vertex $v$ of $S$ dominates a vertex of $G$ that was not dominated by any of the vert…