Isolation game on graphs

Boštjan Brešar, Tanja Dravec, Daniel P. Johnston +2

Given a graph $G$ and a family of graphs $\mathcal{F}$, an $\mathcal{F}$-isolating set, as introduced by Caro and Hansberg, is any set $S\subset V(G)$ such that $G-N[S]$ contains no member…