We study Maker--Breaker total domination game played by two players,Dominator and Staller, on the connected cubic graphs. Staller (playing the roleof Maker) wins if she manages to claim an open neighbourhood of a vertex.Dominator wins otherwise (i.e.\ if he can claim a total dominating set of agraph). For certain graphs on $n\geq 6$ vertices, we give the characterizationon those which are Dominator's win and those which are Staller's win
The domination game played on a graph ▫$G$▫ consists of two players, Dominator and Staller who alter...
The domination game is played on a graph G by two players, Dominator and Staller, who alternately ch...
In this paper we study the (a : b) Maker-Breaker Connectivity game, played on the edge set of the co...
International audienceWe introduce the Maker-Breaker domination game, a two player game on a graph. ...
In the Maker-Breaker domination game played on a graph $G$, Dominator's goalis to select a dominatin...
The recently introduced total domination game is studied. This game is played on a graph G by two pl...
The recently introduced total domination game is studied. This game is played on a graph G by two pl...
AbstractWe study Maker/Breaker games on the edges of the complete graph, as introduced by Chvátal an...
We introduce the concept of guarded subgraph of a graph, which as a condition lies between convex an...
We study the Maker-Breaker k-clique game played on the edge set of the random graph G(n, p). In this...
Two players, Dominator and Staller, alternate choosing vertices of a graph 퐺, one at a time, such th...
The domination game is played on a graph G by Dominator and Staller. The two players are taking turn...
In the domination game on a graph G, two players called Dominator and Staller alternately select ver...
In this paper, we continue the study of the domination game in graphs introduced by Brešar, Klavža...
The total domination game is played on a simple graph G by two players, named Dominator and Staller....
The domination game played on a graph ▫$G$▫ consists of two players, Dominator and Staller who alter...
The domination game is played on a graph G by two players, Dominator and Staller, who alternately ch...
In this paper we study the (a : b) Maker-Breaker Connectivity game, played on the edge set of the co...
International audienceWe introduce the Maker-Breaker domination game, a two player game on a graph. ...
In the Maker-Breaker domination game played on a graph $G$, Dominator's goalis to select a dominatin...
The recently introduced total domination game is studied. This game is played on a graph G by two pl...
The recently introduced total domination game is studied. This game is played on a graph G by two pl...
AbstractWe study Maker/Breaker games on the edges of the complete graph, as introduced by Chvátal an...
We introduce the concept of guarded subgraph of a graph, which as a condition lies between convex an...
We study the Maker-Breaker k-clique game played on the edge set of the random graph G(n, p). In this...
Two players, Dominator and Staller, alternate choosing vertices of a graph 퐺, one at a time, such th...
The domination game is played on a graph G by Dominator and Staller. The two players are taking turn...
In the domination game on a graph G, two players called Dominator and Staller alternately select ver...
In this paper, we continue the study of the domination game in graphs introduced by Brešar, Klavža...
The total domination game is played on a simple graph G by two players, named Dominator and Staller....
The domination game played on a graph ▫$G$▫ consists of two players, Dominator and Staller who alter...
The domination game is played on a graph G by two players, Dominator and Staller, who alternately ch...
In this paper we study the (a : b) Maker-Breaker Connectivity game, played on the edge set of the co...
DOI
Add to ORKG