3 citations · 8 across the 9 of their papers we have counts for
9 papers
The robust chromatic number of certain graph classes
Gábor Bacsó, Csilla Bujtás, Balázs Patkós +2
A 1-selection of a graph is a function such that is incident to for every vertex . The 1-removed is the graph $(V(G),E(G)\setm…
Computational complexity aspects of super domination
Csilla Bujtás, Nima Ghanbari, Sandi Klavžar
Let be a graph. A dominating set is a super dominating set if for every vertex there exists such that $N_G(y)\cap (V(G)\setmi…
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…