Csilla Bujtás

activity

20132026

most citedDomination game on forests

3 citations · 12 across the 19 of their papers we have counts for

collaborators

Showing 2017Show all

4 papers · 1 filter

math.CO2017

On Grundy total domination number in product graphs

Boštjan Brešar, Csilla Bujtás, Tanja Gologranc +6

A longest sequence $(v_{1}, \dots, v_{k})$ of vertices of a graph $G$ is a Grundy total dominating sequence of $G$ if for all $i$ , $N(v_i) \setminus \bigcup_{j=1}^{i-1}N(v_j)\not=\empty…

math.CO2017

Domination game on uniform hypergraphs

Csilla Bujtás, Balázs Patkós, Zsolt Tuza +1

In this paper we introduce and study the domination game on hypergraphs. This is played on a hypergraph $H$ by two players, namely Dominator and Staller, who alternately…

math.CO2017★ 1 cited

On the game total domination number

Csilla Bujtá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 ve…

math.CO2017★ 2 cited

Grundy dominating sequences and zero forcing sets

Boštjan Brešar, Csilla Bujtás, Tanja Gologranc +5

In a graph $G$ a sequence $v_{1}, v_{2}, \dots, v_{m}$ of vertices is Grundy dominating if for all $2 \leq i \leq m$ we have $N [v_{i}] \neq \subseteq \cup_{j = 1}^{i - 1} N [v_{j}]$ and is Grundy total do…