2 citations · 3 across the 4 of their papers we have counts for
8 papers
Complex uniformly resolvable decompositions of
Csilla Bujtàs, Mario Gionfriddo, Elena Guardo +3
In this paper we consider the complex uniformly resolvable decompositions of the complete graph into subgraphs such that each resolution class contains only blocks isomorphic…
Z-domination game
Csilla Bujtás, Vesna Iršič, Sandi Klavžar
The Z-domination game is a variant of the domination game in which each newly selected vertex in the game must have a not yet dominated neighbor, but after the move all vertice…
Partition-crossing hypergraphs
Csilla Bujtás, Zsolt Tuza
For a finite set , we say that a set crosses a partition of if intersects partition classes. If , thi…
On Grundy total domination number in product graphs
Boštjan Brešar, Csilla Bujtás, Tanja Gologranc +6
A longest sequence of vertices of a graph is a Grundy total dominating sequence of if for all , $N(v_i) \setminus \bigcup_{j=1}^{i-1}N(v_j)\not=\empty…
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 by two players, namely Dominator and Staller, who alternately…
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 . Each ve…