2 citations · 2 across the 3 of their papers we have counts for
7 papers
The variety of domination games
Boštjan Brešar, Csilla Bujtás, Tanja Gologranc +6
Domination game [SIAM J.\ Discrete Math.\ 24 (2010) 979--991] and total domination game [Graphs Combin.\ 31 (2015) 1453--1462] are by now well established games played on graphs by…
Cutting Lemma and Union Lemma for the Domination Game
Paul Dorbec, Michael A. Henning, Sandi Klavžar +1
Two new techniques are introduced into the theory of the domination game. The cutting lemma bounds the game domination number of a partially dominated graph with the game dominatio…
On Grundy total domination number in product graphs
Boštjan Brešar, Csilla Bujtás, Tanja Gologranc +6
A longest sequence of vertices of a graph is a Grundy total dominating sequence of if for all , $N(v_i) \setminus \bigcup_{j=1}^{i-1}N(v_j)\not=\empty…
Grundy dominating sequences and zero forcing sets
Boštjan Brešar, Csilla Bujtás, Tanja Gologranc +5
In a graph a sequence of vertices is Grundy dominating if for all we have and is Grundy total do…
Dominating sequences in grid-like and toroidal graphs
Boštjan Brešar, Csilla Bujtás, Tanja Gologranc +5
A longest sequence of distinct vertices of a graph such that each vertex of dominates some vertex that is not dominated by its preceding vertices, is called a Grundy do…
Complexity of the Game Domination Problem
Boštjan Brešar, Paul Dorbec, Sandi Klavžar +2
The game domination number is a graph invariant that arises from a game, which is related to graph domination in a similar way as the game chromatic number is related to graph colo…
Domination game: effect of edge- and vertex-removal
Boštjan Brešar, Paul Dorbec, Sandi Klavžar +1
The domination game is played on a graph by two players, named Dominator and Staller. They alternatively select vertices of such that each chosen vertex enlarges the set of…