3 citations · 8 across the 9 of their papers we have counts for
7 papers · 1 filter
Thresholds for the monochromatic clique transversal game
Csilla Bujtás, Pakanun Dokyeesun, Sandi Klavžar
We study a recently introduced two-person combinatorial game, the -monochromatic clique transversal game which is played by Alice and Bob on a graph . As we observe, this…
Fast winning strategies for Staller in the Maker-Breaker domination game
Csilla Bujtás, Pakanun Dokyeesun
The Maker-Breaker domination game is played on a graph by two players, called Dominator and Staller, who alternately choose a vertex that has not been played so far. Dominator…
Bounds on the 2-domination number
Csilla Bujtás, Szilárd Jaskó
In a graph , a set is called 2-dominating set if each vertex not in has at least two neighbors in . The 2-domination number is the minimum card…
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 …