Related papers: A proof of the 3/4 conjecture for the total domina…
In this paper, we continue the study of the total domination game in graphs introduced in [Graphs Combin. 31(5) (2015), 1453--1462], where the players Dominator and Staller alternately select vertices of $G$. Each vertex chosen must…
The domination game is an optimization game played by two players, Dominator and Staller, who alternately select vertices in a graph $G$. A vertex is said to be dominated if it has been selected or is adjacent to a selected vertex. Each…
The domination game is played on a graph $G$ by two players, Dominator and Staller, who alternate in selecting vertices until each vertex in the graph $G$ is contained in the closed neighbourhood of the set of selected vertices. Dominator's…
The total domination game is a two-person competitive optimization game, where the players, Dominator and Staller, alternately select vertices of an isolate-free graph $G$. Each vertex chosen must strictly increase the number of vertices…
In this paper we introduce and study the domination game on hypergraphs. This is played on a hypergraph $\mathcal{H}$ by two players, namely Dominator and Staller, who alternately select vertices such that each selected vertex enlarges the…
The domination game on a graph $G$ (introduced by B. Bre\v{s}ar, S. Klav\v{z}ar, D.F. Rall \cite{BKR2010}) consists of two players, Dominator and Staller, who take turns choosing a vertex from $G$ such that whenever a vertex is chosen by…
In 2010, Bre\v{s}ar, Klav\v{z}ar and Rall introduced the optimization variant of the graph domination game and the game domination number, which was proved PSPACE-hard by Bre\v{s}ar et al. in 2016. In 2024, Leo Versteegen obtained the…
In the domination game, introduced by Bre\v{s}ar, Klav\v{z}ar and Rall in 2010, Dominator and Staller alternately select a vertex of a graph $G$. A move is legal if the selected vertex $v$ dominates at least one new vertex -- that is, if we…
The $1/2$-conjecture on the domination game asserts that if $G$ is a traceable graph, then the game domination number $\gamma_g(G)$ of $G$ is at most $\left\lceil \frac{n(G)}{2} \right\rceil$. A traceable graph is a $1/2$-graph if…
In the total domination game played on a graph $G$, players Dominator and Staller alternately select vertices of $G$, as long as possible, such that each vertex chosen increases the number of vertices totally dominated. Dominator (Staller)…
We analyze the domination game, where two players, Dominator and Staller, construct together a dominating set M in a given graph, by alternately selecting vertices into M. Each move must increase the size of the dominated set. The players…
In the domination game studied here, Dominator and Staller alternately choose a vertex of a graph $G$ and take it into a set $D$. The number of vertices dominated by the set $D$ must increase in each single turn and the game ends when $D$…
A vertex $u$ in a graph $G$ totally dominates a vertex $v$ if $u$ is adjacent to $v$ in $G$. A total dominating set of $G$ is a set $S$ of vertices of $G$ such that every vertex of $G$ is totally dominated by a vertex in $S$. The indicated…
Let $\gamma_g(G)$ be the game domination number of a graph $G$. Rall conjectured that if $G$ is a traceable graph, then $\gamma_g(G) \le \left\lceil \frac{1}{2}n(G)\right\rceil$. Our main result verifies the conjecture over the class of…
We prove a vertex domination conjecture of Erd\H os, Faudree, Gould, Gy\'arf\'as, Rousseau, and Schelp, that for every n-vertex complete graph with edges coloured using three colours there exists a set of at most three vertices which have…
It is conjectured that the game domination number is at most $3n/5$ for every $n$-vertex graph which does not contain isolated vertices. It was proved in the recent years that the conjecture holds for several graph classes, including the…
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 two players, named Dominator and Staller. In this paper,…
The $3/5$-conjecture for the domination game states that the game domination numbers of an isolate-free graph $G$ on $n$ vertices are bounded as follows: $\gamma_g(G)\leq \frac{3n}5 $ and $\gamma_g'(G)\leq \frac{3n+2}5 $. Recent progress…
A 3-tournament is a complete 3-uniform hypergraph where each edge has a special vertex designated as its tail. A vertex set $X$ dominates $T$ if every vertex not in $X$ is contained in an edge whose tail is in $X$. The domination number of…
In this paper a relationship is established between the domination game and minimal edge cuts. It is proved that the game domination number of a connected graph can be bounded above in terms of the size of minimal edge cuts. In particular,…