3 citations · 6 across the 4 of their papers we have counts for
4 papers · 1 filter
The Disjoint Domination Game
Csilla Bujtás, Zsolt Tuza
We introduce and study a Maker-Breaker type game in which the issue is to create or avoid two disjoint dominating sets in graphs without isolated vertices. We prove that the maker…
Improved upper bounds on the domination number of graphs with minimum degree at least five
Csilla Bujtás, Sandi Klavžar
An algorithmic upper bound on the domination number of graphs in terms of the order and the minimum degree is proved. It is demonstrated that the bound improves best pr…
On the game domination number of graphs with given minimum degree
Csilla Bujtás
In the domination game, introduced by Brešar, Klavžar and Rall in 2010, Dominator and Staller alternately select a vertex of a graph . A move is legal if the selected vertex …
Domination game on forests
Csilla Bujtás
In the domination game studied here, Dominator and Staller alternately choose a vertex of a graph and take it into a set . The number of vertices dominated by the set mu…