3 citations · 6 across the 13 of their papers we have counts for
4 papers · 1 filter
-conjectures on the domination game and claw-free graphs
Csilla Bujtás, Vesna Iršič, Sandi Klavžar
Let be the game domination number of a graph . Rall conjectured that if is a traceable graph, then . Our main re…
Total connected domination game
Csilla Bujtás, Michael A. Henning, Vesna Iršič +1
The (total) connected domination game on a graph is played by two players, Dominator and Staller, according to the standard (total) domination game with the additional requirem…
The domination game played on diameter 2 graphs
Csilla Bujtás, Vesna Iršič, Sandi Klavžar +1
Let be the game domination number of a graph . It is proved that if , then $γ_g(G) \le \left\lceil \frac{n(G)}{2} \right\rceil- \left\lfloor \frac{n(…
On Rall's -conjecture on the domination game
Csilla Bujtás, Vesna Iršič, Sandi Klavžar +1
The -conjecture on the domination game asserts that if is a traceable graph, then the game domination number of is at most $\left\lceil \frac{n(G)}{2} \right\…